{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T09:58:51Z","timestamp":1697968731390},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10273,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1016\/s0166-218x(85)80004-4","type":"journal-article","created":{"date-parts":[[2005,7,12]],"date-time":"2005-07-12T20:06:18Z","timestamp":1121198778000},"page":"129-141","source":"Crossref","is-referenced-by-count":4,"title":["Some basic exchange properties in combinatorial optimization and their application to constructing the K-best solutions"],"prefix":"10.1016","volume":"11","author":[{"given":"Ulrich","family":"Dergis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(85)80004-4_bib1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0166-218X(85)80004-4_bib2","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1287\/mnsc.10.3.578","article-title":"A primal method for the assignment and transportation problem","volume":"10","author":"Balinski","year":"1964","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(85)80004-4_bib3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/net.3230100202","article-title":"The K-best spanning arborescences of a network","volume":"10","author":"Camerini","year":"1980","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(85)80004-4_bib4","first-page":"177","article-title":"A binary enumeration tree to find K-shortest paths","volume":"45","author":"Carraresi","year":"1983","journal-title":"Methods of Oper. Res."},{"key":"10.1016\/S0166-218X(85)80004-4_bib5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0121194","article-title":"A primal algorithm for optimum matching","volume":"8","author":"Cunningham","year":"1978","journal-title":"Math. Programming Study"},{"key":"10.1016\/S0166-218X(85)80004-4_bib6","unstructured":"U. Derigs, Some basic exchange properties in combinatorial optimization and their application to constructing the K-best solutions (Part II), Report No. 83295-OR, Institut f\u00fcr Operations Research, Universit\u00e4t Bonn."},{"key":"10.1016\/S0166-218X(85)80004-4_bib7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1137\/0206011","article-title":"Two algorithms for generating weighted spanning trees in order","volume":"6","author":"Gabow","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(85)80004-4_bib8","unstructured":"H.W. Hamacher, K-best solutions to combinatorial optimization problems, Research Report 83-5, Dept. of Ind. & Syst. Eng., University of Florida, Gainesville."},{"key":"10.1016\/S0166-218X(85)80004-4_bib9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1137\/0210017","article-title":"An algorithm for finding K minimum spanning trees","volume":"10","author":"Katoh","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(85)80004-4_bib10","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","article-title":"A procedure for computing the K-best solutions to discrete optimization problems and its application to the shortest path problem","volume":"18","author":"Lawler","year":"1972","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(85)80004-4_bib11","article-title":"Matching algorithms","author":"Marsh","year":"1979"},{"key":"10.1016\/S0166-218X(85)80004-4_bib12","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1287\/opre.16.3.682","article-title":"An algorithm for ranking all the assignments in order of increasing cost","volume":"16","author":"Murty","year":"1968","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(85)80004-4_bib13","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BF01585502","article-title":"The travelling salesman problem and a class of polyhedra of diameter two","volume":"20","author":"Padberg","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(85)80004-4_bib14","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0130021","article-title":"Adjacency of the traveling salesman tours and 0\u20131 vertices","volume":"30","author":"Rao","year":"1976","journal-title":"SIAM J. Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X85800044?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X85800044?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T15:54:13Z","timestamp":1548345253000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X85800044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["S0166218X85800044"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(85)80004-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}