{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T14:49:27Z","timestamp":1760798967698},"reference-count":37,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0377-2217(02)00353-3","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T10:38:35Z","timestamp":1046774315000},"page":"657-664","source":"Crossref","is-referenced-by-count":14,"title":["Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach"],"prefix":"10.1016","volume":"147","author":[{"given":"Matthias","family":"Ehrgott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders J.V.","family":"Skriver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00353-3_BIB1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0377-2217(93)90095-5","article-title":"An algorithm for the ranking of shortest paths","volume":"69","author":"Azevedo","year":"1993","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/S0377-2217(02)00353-3_BIB2","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/BF01584098","article-title":"Linear programming with multiple objective functions: Step method (stem)","volume":"1","author":"Benayoun","year":"1971","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB3","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0377-2217(89)90384-6","article-title":"k-optimal solution sets for some polynomially solvable scheduling problems","volume":"41","author":"Brucker","year":"1989","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0377-2217(02)00353-3_BIB4","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1057\/palgrave.jors.2600349","article-title":"A naive approach for solving MCDM problems","volume":"48","author":"Buchanan","year":"1997","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"10.1016\/S0377-2217(02)00353-3_BIB5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0167-6377(84)90009-9","article-title":"The matroidal knapsack: A class of (often) well-solvable problems","volume":"3","author":"Camerini","year":"1984","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1137\/0402002","article-title":"Intersection of two matroids: (condensed) Border graphs and ranking","volume":"2","author":"Camerini","year":"1989","journal-title":"SIAM Journal of Algebaric and Discrete Methods"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(87)90017-5","article-title":"Algorithms for finding k-best perfect matchings","volume":"18","author":"Chegireddy","year":"1987","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB8","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(93)90043-N","article-title":"Note on combinatorial optimization with max-linear objective functions","volume":"42","author":"Chung","year":"1993","journal-title":"Discrete Applied Mathematics"},{"issue":"8","key":"10.1016\/S0377-2217(02)00353-3_BIB9","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/S0305-0548(98)00094-X","article-title":"An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions","volume":"26","author":"Coutinho-Rodrigues","year":"1999","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(02)00353-3_BIB10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1080\/02331939608844238","article-title":"On matroids with multiple objectives","volume":"38","author":"Ehrgott","year":"1996","journal-title":"Optimization"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB11","first-page":"229","article-title":"Integer solutions of multicriteria network flow problems","volume":"19","author":"Ehrgott","year":"1999","journal-title":"Investigacao Operacional"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1111\/j.1475-3995.2000.tb00182.x","article-title":"Approximation algorithms for combinatorial multicriteria optimization problems","volume":"7","author":"Ehrgott","year":"2000","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22199-0","article-title":"Multicriteria optimization","author":"Ehrgott","year":"2000"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB14","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s002910000046","article-title":"A survey and annotated bibliography of multiobjective combinatorial optimization","volume":"22","author":"Ehrgott","year":"2000","journal-title":"Operations Research Spektrum"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(99)00005-0","article-title":"Geometric methods to solve max-ordering location problems","volume":"93","author":"Ehrgott","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB16","doi-asserted-by":"crossref","unstructured":"M. Ehrgott, D. Tenfelde, Computation of ideal and Nadir values and implications for their use in MCDM methods. European Journal of Operational Research, forthcoming","DOI":"10.1016\/S0377-2217(02)00595-7"},{"issue":"2","key":"10.1016\/S0377-2217(02)00353-3_BIB17","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","article-title":"Finding the k shortest paths","volume":"28","author":"Eppstein","year":"1998","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10.1016\/S0377-2217(02)00353-3_BIB18","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 Journal of Computing"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB19","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF02099691","article-title":"A note on K-best network flows","volume":"57","author":"Hamacher","year":"1995","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB20","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02022039","article-title":"K-best solutions to combinatorial optimization problems","volume":"4","author":"Hamacher","year":"1985","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB21","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02032304","article-title":"On spanning tree problems with multiple objectives","volume":"52","author":"Hamacher","year":"1994","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(02)00353-3_BIB22","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 Journal of Computing"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB23","series-title":"Robust Discrete Optimization and Its Applications","author":"Kouvelis","year":"1998"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB24","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 Science"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB25","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0377-2217(93)90213-7","article-title":"Bicriteria network flow problems: Integer case","volume":"66","author":"Lee","year":"1993","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/S0377-2217(02)00353-3_BIB26","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1142\/S0129054199000186","article-title":"Deviation algorithms for ranking shortest paths","volume":"10","author":"Martins","year":"1999","journal-title":"International Journal of Foundations of Computer Science"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB27","unstructured":"E.Q.V. Martins, M.M.B. Pascoal, J.L.E. Dos Santos, A new improvement for a k shortest paths algorithm, Technical report, Universidade de Coimbra, 2000"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB28","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1002\/1520-6750(199208)39:5<669::AID-NAV3220390506>3.0.CO;2-W","article-title":"Solving min\u2013max shortest-path problems on a network","volume":"39","author":"Murthy","year":"1992","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB29","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/S0377-2217(97)00391-3","article-title":"The problem of the optimal biobjective spanning tree","volume":"111","author":"Ramos","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB30","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/trsc.22.2.83","article-title":"A model and solution algorithm for optimal routing of a time-chartered containership","volume":"22","author":"Rana","year":"1988","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB31","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/0377-2217(93)90192-P","article-title":"Approximating the noninferior set in multiobjective linear programming problems","volume":"68","author":"Solanki","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB32","series-title":"Multiple Criteria Optimization: Theory, Computation and Application","author":"Steuer","year":"1985"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB33","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/BF02591870","article-title":"An interactive weighted Tchebycheff procedure for multiple objective programming","volume":"26","author":"Steuer","year":"1983","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB34","unstructured":"E.L. Ulungu, J. Teghem, Application of the two phases method to solve the bi-objective knapsack problem. Technical report, Facult\u00e9 Polytechnique de Mons, Belgium, 1994"},{"issue":"2","key":"10.1016\/S0377-2217(02)00353-3_BIB35","first-page":"149","article-title":"The two-phases method: An efficient procedure to solve bi-objective combinatorial optimization problems","volume":"20","author":"Ulungu","year":"1994","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"10.1016\/S0377-2217(02)00353-3_BIB36","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1008258310679","article-title":"Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem","volume":"12","author":"Vis\u00e9e","year":"1998","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"10.1016\/S0377-2217(02)00353-3_BIB37","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","article-title":"Aproximation of pareto optima in multiple-objective shortest-path problems","volume":"35","author":"Warburton","year":"1987","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702003533?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702003533?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T22:57:27Z","timestamp":1554764247000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702003533"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0377221702003533"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00353-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}