{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T20:45:20Z","timestamp":1779396320588,"version":"3.53.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T00:00:00Z","timestamp":1470614400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10107-016-1061-z","type":"journal-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T06:53:26Z","timestamp":1470639206000},"page":"213-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A parametric simplex algorithm for linear vector optimization problems"],"prefix":"10.1007","volume":"163","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1675-5451","authenticated-orcid":false,"given":"Birgit","family":"Rudloff","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0532-9927","authenticated-orcid":false,"given":"Firdevs","family":"Ulus","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Vanderbei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,8]]},"reference":[{"key":"1061_CR1","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF01582157","volume":"61","author":"P Armand","year":"1993","unstructured":"Armand, P.: Finding all maximal efficient faces in multiobjective linear programming. Math. Program. 61, 357\u2013375 (1993)","journal-title":"Math. Program."},{"key":"1061_CR2","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF00941298","volume":"70","author":"P Armand","year":"1991","unstructured":"Armand, P., Malivert, C.: Determination of the efficient set in multiobjective linear programming. J. Optim. Theory Appl. 70, 467\u2013489 (1991)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"1061_CR3","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/235815.235821","volume":"22","author":"CB Barber","year":"1996","unstructured":"Barber, C.B., Dobkin, D.P., Huhdanpaa, H.T.: The Quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22(4), 469\u2013483 (1996)","journal-title":"ACM Trans. Math. Softw."},{"key":"1061_CR4","unstructured":"Bencomo, M., Gutierrez, L., Ceberio, M.: Modified Fourier-Motzkin elimination algorithm for reducing systems of linear inequalities with unconstrained parameters. Departmental Technical Reports (CS) 593, University of Texas at El Paso (2011)"},{"key":"1061_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1008215702611","volume":"13","author":"HP Benson","year":"1998","unstructured":"Benson, H.P.: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J. Global Optim. 13, 1\u201324 (1998)","journal-title":"J. Global Optim."},{"issue":"1","key":"1061_CR6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10589-015-9760-6","volume":"63","author":"L Csirmaz","year":"2016","unstructured":"Csirmaz, L.: Using multiobjective optimization to map the entropy region. Comput. Optim. Appl. 63(1), 45\u201367 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1061_CR7","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0022-247X(87)90065-5","volume":"126","author":"JP Dauer","year":"1987","unstructured":"Dauer, J.P.: Analysis of the objective space in multiple objective linear programming. J. Math. Anal. Appl. 126(2), 579\u2013593 (1987)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"1061_CR8","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/0377-2217(90)90010-9","volume":"46","author":"JP Dauer","year":"1990","unstructured":"Dauer, J.P., Liu, Y.H.: Solving multiple objective linear programs in objective space. Eur. J. Oper. Res. 46(3), 350\u2013357 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"1061_CR9","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF00935493","volume":"30","author":"JG Ecker","year":"1980","unstructured":"Ecker, J.G., Hegner, N.S., Kouada, I.A.: Generating all maximal efficient faces for multiple objective linear programs. J. Optim. Theory Appl. 30, 353\u2013381 (1980)","journal-title":"J. Optim. Theory Appl."},{"issue":"12","key":"1061_CR10","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01588968","volume":"14","author":"JG Ecker","year":"1978","unstructured":"Ecker, J.G., Kouada, I.A.: Finding all efficient extreme points for multiple objective linear programs. Math. Program. 14(12), 249\u2013261 (1978)","journal-title":"Math. Program."},{"key":"1061_CR11","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2005)"},{"issue":"4","key":"1061_CR12","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1007\/s10898-011-9709-y","volume":"52","author":"M Ehrgott","year":"2012","unstructured":"Ehrgott, M., L\u00f6hne, A., Shao, L.: A dual variant of Benson\u2019s outer approximation algorithm. J. Global Optim. 52(4), 757\u2013778 (2012)","journal-title":"J. Global Optim."},{"key":"1061_CR13","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., Rodriguez-Ch\u00eda, A.M.: Primal-dual simplex method for multiobjective linear programming. J. Optim. Theory Appl. 134, 483\u2013497 (2007)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1061_CR14","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10898-010-9588-7","volume":"50","author":"M Ehrgott","year":"2011","unstructured":"Ehrgott, M., Shao, L., Sch\u00f6bel, A.: An approximation algorithm for convex multi-objective programming problems. J. Global Optim. 50(3), 397\u2013416 (2011)","journal-title":"J. Global Optim."},{"issue":"1","key":"1061_CR15","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580111","volume":"5","author":"JP Evans","year":"1973","unstructured":"Evans, J.P., Steuer, R.E.: A revised simplex method for multiple objective programs. Math. Program. 5(1), 54\u201372 (1973)","journal-title":"Math. Program."},{"issue":"4","key":"1061_CR16","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1007\/s10898-013-0098-2","volume":"59","author":"AH Hamel","year":"2014","unstructured":"Hamel, A.H., L\u00f6hne, A., Rudloff, B.: Benson type algorithms for linear vector optimization and applications. J. Global Optim. 59(4), 811\u2013836 (2014)","journal-title":"J. Global Optim."},{"issue":"3","key":"1061_CR17","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1057\/jors.1977.147","volume":"28","author":"H Isermann","year":"1977","unstructured":"Isermann, H.: The enumeration of the set of all efficient solutions for a linear multiple objective program. Oper. Res. Q. 28(3), 711\u2013725 (1977)","journal-title":"Oper. Res. Q."},{"key":"1061_CR18","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(94)90155-4","volume":"130","author":"B Kalyanasundaram","year":"1994","unstructured":"Kalyanasundaram, B., Pruhs, K.R.: Constructing competetive tours from local information. Theor. Comput. Sci. 130, 125\u2013138 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"1061_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-18351-5","volume-title":"Vector Optimization with Infimum and Supremum","author":"A L\u00f6hne","year":"2011","unstructured":"L\u00f6hne, A.: Vector Optimization with Infimum and Supremum. Springer, Berlin (2011)"},{"key":"1061_CR20","unstructured":"L\u00f6hne, A.: BENSOLVE: A free VLP solver, version 1.2. (2012). http:\/\/ito.mathematik.uni-halle.de\/~loehne"},{"issue":"4","key":"1061_CR21","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1007\/s10898-013-0136-0","volume":"60","author":"A L\u00f6hne","year":"2014","unstructured":"L\u00f6hne, A., Rudloff, B., Ulus, F.: Primal and dual approximation algorithms for convex vector optimization problems. J. Global Optim. 60(4), 713\u2013736 (2014)","journal-title":"J. Global Optim."},{"key":"1061_CR22","unstructured":"L\u00f6hne, A., Wei\u00dfing, B.: BENSOLVE: A free VLP solver, version 2.0.1 (2015). http:\/\/bensolve.org\/"},{"key":"1061_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.02.039","author":"A L\u00f6hne","year":"2016","unstructured":"L\u00f6hne, A., Wei\u00dfing, B.: The vector linear program solver bensolve: notes on theoretical background. Eur. J. Oper. Res. (2016). doi: 10.1016\/j.ejor.2016.02.039","journal-title":"Eur. J. Oper. Res."},{"key":"1061_CR24","volume-title":"Theory of Vector Optimization, Lecture Notes in Economics and Mathematical Systems","author":"D Luc","year":"1989","unstructured":"Luc, D.: Theory of Vector Optimization, Lecture Notes in Economics and Mathematical Systems, vol. 319. Springer, Berlin (1989)"},{"key":"1061_CR25","unstructured":"Makhorin, A.: GLPK (GNU linear programming kit) (2012). https:\/\/www.gnu.org\/software\/glpk\/"},{"key":"1061_CR26","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1287\/ijoc.1090.0342","volume":"22","author":"A Przybylski","year":"2010","unstructured":"Przybylski, A., Gandibleux, X., Ehrgott, M.: A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS J. Comput. 22, 371\u2013386 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"1061_CR27","doi-asserted-by":"crossref","first-page":"1287","DOI":"10.1111\/1468-0262.t01-1-00448","volume":"71","author":"A Ruszczy\u0144ski","year":"2003","unstructured":"Ruszczy\u0144ski, A., Vanderbei, R.J.: Frontiers of stochastically nondominated portfolios. Econometrica 71(4), 1287\u20131297 (2003)","journal-title":"Econometrica"},{"issue":"4","key":"1061_CR28","first-page":"351","volume":"30","author":"M Schechter","year":"2005","unstructured":"Schechter, M., Steuer, R.E.: A correction to the connectedness of the Evans\u2013Steuer algorithm of multiple objective linear programming. Found. Comput. Decis. Sci. 30(4), 351\u2013359 (2005)","journal-title":"Found. Comput. Decis. Sci."},{"issue":"2","key":"1061_CR29","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s00186-008-0220-2","volume":"68","author":"L Shao","year":"2008","unstructured":"Shao, L., Ehrgott, M.: Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning. Math. Methods Oper. Res. 68(2), 257\u2013276 (2008)","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"1061_CR30","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s00186-007-0194-5","volume":"68","author":"L Shao","year":"2008","unstructured":"Shao, L., Ehrgott, M.: Approximating the nondominated set of an MOLP by approximately solving its dual problem. Math. Methods Oper. Res. 68(3), 469\u2013492 (2008)","journal-title":"Math. Methods Oper. Res."},{"key":"1061_CR31","volume-title":"A Multiple Objective Linear Programming Solver for All Efficient Extreme Points and All Unbounded Efficient Edges","author":"RE Steuer","year":"2004","unstructured":"Steuer, R.E.: A Multiple Objective Linear Programming Solver for All Efficient Extreme Points and All Unbounded Efficient Edges. Terry College of Business, University of Georgia, Athens (2004)"},{"key":"1061_CR32","volume-title":"Linear Programming: Foundations and Extensions","author":"RJ Vanderbei","year":"2013","unstructured":"Vanderbei, R.J.: Linear Programming: Foundations and Extensions. Kluwer Academic Publishers, Dordrecht (2013)"},{"issue":"3","key":"1061_CR33","first-page":"786","volume":"28","author":"S Zionts","year":"1980","unstructured":"Zionts, S., Wallenius, J.: Identifying efficient vectors: some theory and computational results. Oper. Res. 28(3), 786\u2013793 (1980)","journal-title":"Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1061-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1061-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1061-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1061-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:10:58Z","timestamp":1498320658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1061-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,8]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1061"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1061-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,8]]}}}