{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:55:24Z","timestamp":1773482124590,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,11,1]],"date-time":"1987-11-01T00:00:00Z","timestamp":562723200000},"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":9390,"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":[[1987,11]]},"DOI":"10.1016\/0166-218x(87)90017-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"155-165","source":"Crossref","is-referenced-by-count":68,"title":["Algorithms for finding K-best perfect matchings"],"prefix":"10.1016","volume":"18","author":[{"given":"Chandra R.","family":"Chegireddy","sequence":"first","affiliation":[]},{"given":"Horst W.","family":"Hamacher","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0166-218X(87)90017-5_BIB1","first-page":"496","article-title":"A dual shortest path algorithm","volume":"26","author":"Bazaraa","year":"1974","journal-title":"J. SIAM"},{"key":"10.1016\/0166-218X(87)90017-5_BIB2","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0121194","article-title":"A primal method for solving minimal perfect matching problems","volume":"8","author":"Cunningham","year":"1978","journal-title":"Math. Programming Study"},{"key":"10.1016\/0166-218X(87)90017-5_BIB3","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1002\/net.3230040404","article-title":"Shortest alternating path algorithms","volume":"4","author":"Brown","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0166-218X(87)90017-5_BIB4","series-title":"Technical Report","article-title":"Algorithms and programs for K-th best weighted bipartite matching problem","author":"Chegireddy","year":"1985"},{"key":"10.1016\/0166-218X(87)90017-5_BIB5","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/net.3230110407","article-title":"A shortest augmenting path method for solving minimal perfect matching problems","volume":"11","author":"Derigs","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0166-218X(87)90017-5_BIB6","series-title":"Report No 82222-OR","article-title":"Shortest augmenting paths and sensititivity analysis for optimal matchings","author":"Derigs","year":"1982"},{"key":"10.1016\/0166-218X(87)90017-5_BIB7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/0166-218X(87)90017-5_BIB8","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"issue":"2","key":"10.1016\/0166-218X(87)90017-5_BIB9","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/0166-218X(87)90017-5_BIB10","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97: shortest path","volume":"5","author":"Floyd","year":"1962","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(87)90017-5_BIB11","article-title":"Shortest path methods: A unifying approach","volume":"83","author":"Gallo","year":"1983","journal-title":"Netflow"},{"key":"10.1016\/0166-218X(87)90017-5_BIB12","first-page":"123","article-title":"K-best solutions to combinatorial optimization problems","volume":"4","author":"Hamacher","year":"1985"},{"issue":"7","key":"10.1016\/0166-218X(87)90017-5_BIB13","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","article-title":"A procedure for computing the K-th 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\/0166-218X(87)90017-5_BIB14","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(87)90017-5_BIB15","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":"Operations Research"},{"key":"10.1016\/0166-218X(87)90017-5_BIB16","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1145\/355900.355919","article-title":"Algorithm 562: shortest path lengths","volume":"5","author":"Pape","year":"1980","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0166-218X(87)90017-5_BIB17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1002\/net.3230110105","article-title":"Sensitivity analysis of optimal matchings","volume":"11","author":"Weber","year":"1981","journal-title":"Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900175?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900175?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:53:25Z","timestamp":1555134805000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,11]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,11]]}},"alternative-id":["0166218X87900175"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90017-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,11]]}}}