{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T22:24:17Z","timestamp":1771367057352,"version":"3.50.1"},"reference-count":50,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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":7290,"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":[[1993,8]]},"DOI":"10.1016\/0166-218x(93)90054-r","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"93-115","source":"Crossref","is-referenced-by-count":19,"title":["A genuinely polynomial primal simplex algorithm for the assignment problem"],"prefix":"10.1016","volume":"45","author":[{"given":"Mustafa","family":"Akg\u00fcl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90054-R_BIB1","series-title":"Tech. Rept.","article-title":"A dual forest algorithm for the assignment problem","author":"Achatz","year":"1989"},{"key":"10.1016\/0166-218X(93)90054-R_BIB2","article-title":"Topics in Relaxation and Ellipsoidal Methods","volume":"97","author":"Akg\u00fcl","year":"1984"},{"key":"10.1016\/0166-218X(93)90054-R_BIB3_1","series-title":"Tech. Rept.","article-title":"A genuinely polynomial primal simplex algorithm for the assignment problem","author":"Akg\u00fcl","year":"1985"},{"key":"10.1016\/0166-218X(93)90054-R_BIB3_2","series-title":"Working Paper IEOR 87-07","author":"Akg\u00fcl","year":"1987"},{"key":"10.1016\/0166-218X(93)90054-R_BIB4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0167-6377(88)90082-X","article-title":"A sequential dual simplex algorithm for the linear assignment problem","volume":"7","author":"Akg\u00fcl","year":"1988","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(93)90054-R_BIB5","series-title":"Working Paper IEOR 88-04","article-title":"Shortest paths and the simplex method","author":"Akg\u00fcl","year":"1988"},{"key":"10.1016\/0166-218X(93)90054-R_BIB6","first-page":"403","article-title":"A dual feasible forest algorithm for the linear assignment problem","volume":"25","author":"Akg\u00fcl","year":"1991","journal-title":"Res. Op\u00e9r."},{"key":"10.1016\/0166-218X(93)90054-R_BIB7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/net.3230080405","article-title":"Primal simplex network codes: state-of-the-art implementation technology","volume":"8","author":"Ali","year":"1978","journal-title":"Networks"},{"key":"10.1016\/0166-218X(93)90054-R_BIB8_1","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/opre.33.3.527","article-title":"Signature method for the assignment problem","volume":"33","author":"Balinski","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(93)90054-R_BIB8_2","series-title":"Presented at Mathematical Programming Symposium, Bonn","author":"Balinski","year":"1982"},{"key":"10.1016\/0166-218X(93)90054-R_BIB9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01580579","article-title":"A competitive (dual) simplex method for the assignment problem","volume":"34","author":"Balinski","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90054-R_BIB10","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1287\/mnsc.10.3.578","article-title":"A primal method for the assignment and transportation problems","volume":"10","author":"Balinski","year":"1964","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(93)90054-R_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584319","article-title":"The alternating basis algorithm for assignment problems","volume":"13","author":"Barr","year":"1977","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90054-R_BIB12","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/BF01584237","article-title":"A new algorithm for the assignment problem","volume":"21","author":"Bertsekas","year":"1981","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90054-R_BIB13","series-title":"Advanced Techniques in the Practice of Operations Research","first-page":"333","article-title":"Matroids and operations research","author":"Bixby","year":"1982"},{"key":"10.1016\/0166-218X(93)90054-R_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.24.1.1","article-title":"Design and implementation of large scale primal transshipment algorithms","volume":"24","author":"Bradley","year":"1977","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(93)90054-R_BIB15","first-page":"193","article-title":"Travelling salesman and assignment problems: a survey","volume":"4","author":"Burkard","year":"1979"},{"key":"10.1016\/0166-218X(93)90054-R_BIB16","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/BF01593800","article-title":"An algebraic approach to assignment problems","volume":"12","author":"Burkard","year":"1977","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90054-R_BIB17","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0166-218X(87)90016-3","article-title":"Primal-dual algorithms for the assignment problem","volume":"18","author":"Carpaneto","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(93)90054-R_BIB18","series-title":"Linear Programming","author":"Chv\u00e1tal","year":"1983"},{"key":"10.1016\/0166-218X(93)90054-R_BIB19","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01580379","article-title":"A network simplex method","volume":"11","author":"Cunningham","year":"1976","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90054-R_BIB20","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/moor.4.2.196","article-title":"Theoretical properties of the network simplex method","volume":"4","author":"Cunningham","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(93)90054-R_BIB21","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 Stud."},{"key":"10.1016\/0166-218X(93)90054-R_BIB22","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"key":"10.1016\/0166-218X(93)90054-R_BIB23","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02022037","article-title":"The shortest augmenting path method for solving assignment problems\u2014motivation and computational experience","volume":"4","author":"Derigs","year":"1985","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/0166-218X(93)90054-R_BIB24","first-page":"1324","article-title":"An algorithm for the solution of the assignment problem","volume":"10","author":"Dinic","year":"1969","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0166-218X(93)90054-R_BIB25","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"},{"key":"10.1016\/0166-218X(93)90054-R_BIB26","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0166-218X(93)90054-R_BIB27_1","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(93)90054-R_BIB27_2","first-page":"338","author":"Fredman","year":"1984","journal-title":"Proceedings 25th FOCS"},{"key":"10.1016\/0166-218X(93)90054-R_BIB28","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/net.3230040302","article-title":"Implementation and computational comparisons of primal, dual, primal-dual codes for minimum cost network flow problems","volume":"4","author":"Glover","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0166-218X(93)90054-R_BIB29","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01582245","article-title":"Efficient dual simplex algorithms for the assignment problem","volume":"37","author":"Goldfarb","year":"1985","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90054-R_BIB30","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/opre.31.3.595","article-title":"A polynomial simplex method for the assignment problem","volume":"31","author":"Hung","year":"1983","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(93)90054-R_BIB31","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1287\/opre.28.4.969","article-title":"Solving the assignment problem by relaxation","volume":"27","author":"Hung","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(93)90054-R_BIB32","article-title":"Flows in networks","author":"Johnson","year":"1978"},{"key":"10.1016\/0166-218X(93)90054-R_BIB33","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","article-title":"A shortest path algorithm for dense and sparse linear assignment problems","volume":"38","author":"Jonker","year":"1987","journal-title":"Computing"},{"key":"10.1016\/0166-218X(93)90054-R_BIB34","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The hungarian method for the assignment problem","volume":"2","author":"Kuhn","year":"1955","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(93)90054-R_BIB35","first-page":"32","article-title":"Algorithms for the assignment and transportation problems","volume":"5","author":"Munkres","year":"1957","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)90054-R_BIB36","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/BFb0121050","article-title":"On the simplex algorithm for networks and generalized networks","volume":"24","author":"Orlin","year":"1985","journal-title":"Math. Programming Stud."},{"key":"10.1016\/0166-218X(93)90054-R_BIB37","series-title":"Combinatorial Optimization: Algorithms & Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0166-218X(93)90054-R_BIB38","series-title":"Network Flows and Monotropic Optimization","author":"Rockafellar","year":"1984"},{"key":"10.1016\/0166-218X(93)90054-R_BIB39_1","series-title":"PhD thesis","article-title":"Improvements to the theoretical efficiency of the simplex method","author":"Roohy-Laleh","year":"1981"},{"key":"10.1016\/0166-218X(93)90054-R_BIB39_2","first-page":"448B","volume":"43","author":"Roohy-Laleh","year":"1982","journal-title":"Dissertation Abstract International"},{"key":"10.1016\/0166-218X(93)90054-R_BIB40","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","article-title":"A data structure for dynamic trees","volume":"26","author":"Sleator","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(93)90054-R_BIB41","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1145\/321724.321734","article-title":"Accelerated algorithms for labelling and relabelling of trees, with applications to distribution problems","volume":"19","author":"Srinivasan","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(93)90054-R_BIB42","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/321752.321754","article-title":"Benefit-cost analysis for coding techniques for the primal transportation problem","volume":"20","author":"Srinivasan","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(93)90054-R_BIB43","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/BF01593805","article-title":"Cost operator algorithms for the transportation problem","volume":"12","author":"Srinivasan","year":"1977","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90054-R_BIB44","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0166-218X(93)90054-R_BIB45","first-page":"319","article-title":"A recursive method for the assignment problems","volume":"11","author":"Thompson","year":"1981"},{"key":"10.1016\/0166-218X(93)90054-R_BIB46","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230010206","article-title":"On some techniques useful for solution of transportation network problems","volume":"1","author":"Tomizawa","year":"1972","journal-title":"Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390054R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390054R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:25:55Z","timestamp":1555136755000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390054R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["0166218X9390054R"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90054-r","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}