{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:24:45Z","timestamp":1758273885769},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,9,18]],"date-time":"2008-09-18T00:00:00Z","timestamp":1221696000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s10288-008-0087-3","type":"journal-article","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T11:52:56Z","timestamp":1221652376000},"page":"255-273","source":"Crossref","is-referenced-by-count":7,"title":["A primal\u2013dual simplex algorithm for bi-objective network flow problems"],"prefix":"10.1007","volume":"7","author":[{"given":"Augusto","family":"Eus\u00e9bio","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Rui","family":"Figueira","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Ehrgott","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,9,18]]},"reference":[{"key":"87_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja R, Magnanti TL, Orlin J (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs"},{"key":"87_CR2","volume-title":"Linear programming and network flows","author":"MS Bazaraa","year":"2005","unstructured":"Bazaraa MS, Jarvis JJ, Sherali HD (2005) Linear programming and network flows, 3rd edn. Wiley, New York","edition":"3"},{"issue":"1","key":"87_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1004605810296","volume":"105","author":"HP Benson","year":"2000","unstructured":"Benson HP, Sun E (2000) Outcome space partition of the weight set in multiobjective linear programming. J Optim Theory Appl 105(1): 17\u201336","journal-title":"J Optim Theory Appl"},{"key":"87_CR4","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott M (2005) Multicriteria optimization, 2nd edn. Springer, Berlin","edition":"2"},{"key":"87_CR5","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/0-387-23081-5_17","volume-title":"Multicriteria decision analysis: state of the art surveys","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott M, Wiecek M (2005) Multiobjective programming. In: Figueira J, Greco S, Ehrgott M (eds) Multicriteria decision analysis: state of the art surveys. Springer Science + Business Media, New York, pp 667\u2013722"},{"key":"87_CR6","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10957-007-9232-y","volume":"134","author":"M Ehrgott","year":"2007","unstructured":"Ehrgott M, Puerto J, Rodr\u00edguez-Ch\u00eda AM (2007) A primal\u2013dual simplex method for multiobjective linear programming. J Optim Theory Appl 134: 483\u2013497","journal-title":"J Optim Theory Appl"},{"key":"87_CR7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BFb0121089","volume":"26","author":"MD Grigoriadis","year":"1986","unstructured":"Grigoriadis MD (1986) An efficient implementation of the network simplex method. Math Program Study 26: 83\u2013111","journal-title":"Math Program Study"},{"key":"87_CR8","doi-asserted-by":"crossref","first-page":"1404","DOI":"10.1016\/j.ejor.2005.09.033","volume":"176","author":"HW Hamacher","year":"2007","unstructured":"Hamacher HW, Pedersen CR, Ruzika S (2007) Multiple objective minimum cost flow problems: a review. Eur J Oper Res 176: 1404\u20131422","journal-title":"Eur J Oper Res"},{"issue":"5","key":"87_CR9","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D Klingman","year":"1974","unstructured":"Klingman D, Napier A, Stutz J (1974) Netgen: a program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. Manage Sci 20(5): 814\u2013821","journal-title":"Manage Sci"},{"key":"87_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0377-2217(91)90151-K","volume":"51","author":"H Lee","year":"1991","unstructured":"Lee H, Pulat PS (1991) Bicriteria network flow problems: continuous case. Eur J Oper Res 51: 119\u2013126","journal-title":"Eur J Oper Res"},{"issue":"1","key":"87_CR11","first-page":"95","volume":"26","author":"R Malhotra","year":"1984","unstructured":"Malhotra R, Puri MC (1984) Bi-criteria network problem. Cah C.E.R.O. 26(1): 95\u2013102","journal-title":"Cah C.E.R.O."},{"key":"87_CR12","volume-title":"Combinatorial optimization: algorithms and complexity","author":"CH Papadimitriou","year":"1982","unstructured":"Papadimitriou CH (1982) Combinatorial optimization: algorithms and complexity. Prentice Hall, Englewood Cliffs"},{"issue":"7","key":"87_CR13","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/0305-0548(92)90034-3","volume":"19","author":"PS Pulat","year":"1992","unstructured":"Pulat PS, Huarng F, Lee H (1992) Efficient solutions for the bicriteria network flow problem. Comput Oper Res 19(7): 649\u2013655","journal-title":"Comput Oper Res"},{"key":"87_CR14","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/S0377-2217(99)00191-5","volume":"124","author":"A Sede\u00f1o-Noda","year":"2000","unstructured":"Sede\u00f1o-Noda A, Gonz\u00e1lez-Mart\u00edn C (2000) The biobjective minimum cost flow problem. Eur J Oper Res 124: 591\u2013600","journal-title":"Eur J Oper Res"},{"key":"87_CR15","first-page":"241","volume":"20","author":"A Sede\u00f1o-Noda","year":"2003","unstructured":"Sede\u00f1o-Noda A, Gonz\u00e1lez-Mart\u00edn C (2003) An alternative method to solve the biobjective minimum cost flow problem. Asia-Pacific J Oper Res 20: 241\u2013260","journal-title":"Asia-Pacific J Oper Res"},{"key":"87_CR16","volume-title":"Multiple criteria optimization: theory, computation, and application","author":"RE Steuer","year":"1986","unstructured":"Steuer RE (1986) Multiple criteria optimization: theory, computation, and application. Wiley, New York"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-008-0087-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-008-0087-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-008-0087-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:55Z","timestamp":1559131975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-008-0087-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,18]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["87"],"URL":"https:\/\/doi.org\/10.1007\/s10288-008-0087-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,18]]}}}