{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T00:42:08Z","timestamp":1768437728706,"version":"3.49.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319231136","type":"print"},{"value":"9783319231143","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23114-3_19","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T09:01:33Z","timestamp":1440666093000},"page":"305-321","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems"],"prefix":"10.1007","author":[{"given":"Lucie","family":"Galand","sequence":"first","affiliation":[]},{"given":"Thibaut","family":"Lust","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Kostreva, M.M., Ogryczak, W.: Linear optimization with multiple equitable criteria. RAIRO - Operations Research 33 (7 1999) 275\u2013297","DOI":"10.1051\/ro:1999112"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.ejor.2003.06.010","volume":"158","author":"M Kostreva","year":"2004","unstructured":"Kostreva, M., Ogryczak, W., Wierzbicki, A.: Equitable aggregations and multiple criteria analysis. Eur. J. Oper. Res. 158(2), 362\u2013377 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10479-006-0073-0","volume":"147","author":"P Perny","year":"2006","unstructured":"Perny, P., Spanjaard, O., Storme, L.X.: A decision-theoretic approach to robust optimization in multivalued graphs. Annals OR 147(1), 317\u2013341 (2006)","journal-title":"Annals OR"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00932614","volume":"14","author":"P Yu","year":"1974","unstructured":"Yu, P.: Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives. J. Optim. Theory Appl. 14(3), 319\u2013377 (1974)","journal-title":"J. Optim. Theory Appl."},{"issue":"1\u20132","key":"19_CR5","first-page":"225","volume":"52","author":"D Baatar","year":"2006","unstructured":"Baatar, D., Wiecek, M.: Advancing equitability in multiobjective programming. Computational&. Applied Mathematics 52(1\u20132), 225\u2013234 (2006)","journal-title":"Applied Mathematics"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-19893-9_36","volume-title":"Evolutionary Multi-Criterion Optimization","author":"A Moghaddam","year":"2011","unstructured":"Moghaddam, A., Yalaoui, F., Amodeo, L.: Lorenz versus Pareto dominance in a single machine scheduling problem with rejection. In: Takahashi, R., Deb, K., Wanner, E., Greco, S. (eds.) Evolutionary Multi-Criterion Optimization. Lecture Notes in Computer Science, vol. 6576, pp. 520\u2013534. Springer, Berlin Heidelberg (2011)"},{"key":"19_CR7","unstructured":"Endriss, U.: Reduction of economic inequality in combinatorial domains. In: AAMAS. (2013) 175\u2013182"},{"key":"19_CR8","first-page":"149","volume":"20","author":"E Ulungu","year":"1995","unstructured":"Ulungu, E., Teghem, J.: The two-phases method: An efficient procedure to solve biobjective combinatorial optimization problems. Foundation of Computing and Decision Science 20, 149\u2013156 (1995)","journal-title":"Foundation of Computing and Decision Science"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1008258310679","volume":"12","author":"M Vis\u00e9e","year":"1998","unstructured":"Vis\u00e9e, M., Teghem, J., Pirlot, M., Ulungu, E.: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. J. Global Optim. 12, 139\u2013155 (1998)","journal-title":"J. Global Optim."},{"issue":"3","key":"19_CR10","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/S0377-2217(02)00353-3","volume":"147","author":"M Ehrgott","year":"2003","unstructured":"Ehrgott, M., Skriver, A.: Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach. Eur. J. Oper. Res. 147(3), 657\u2013664 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.ejor.2006.12.054","volume":"185","author":"A Przybylski","year":"2008","unstructured":"Przybylski, A., Gandibleux, X., Ehrgott, M.: Two-phase algorithms for the biobjective assignement problem. Eur. J. Oper. Res. 185(2), 509\u2013533 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"19_CR12","first-page":"1945","volume":"36","author":"A Raith","year":"2009","unstructured":"Raith, A., Ehrgott, M.: A two-phase algorithm for the biobjective integer minimum cost flow problem. Computers&. Oper. Res. 36(6), 1945\u20131954 (2009)","journal-title":"Oper. Res."},{"key":"19_CR13","volume-title":"Inequalities","author":"G Hardy","year":"1952","unstructured":"Hardy, G., Littlewood, J., P\u00f3lya, G.: Inequalities. Cambridge University Press, Cambridge Mathematical Library (1952)"},{"issue":"197","key":"19_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.2307\/2554117","volume":"50","author":"AF Shorrocks","year":"1983","unstructured":"Shorrocks, A.F.: Ranking income distributions. Economica 50(197), 3\u201317 (1983)","journal-title":"Economica"},{"key":"19_CR15","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Berlin (2005)","edition":"2"},{"key":"19_CR16","unstructured":"Perny, P., Weng, P., Goldsmith, J., Hanna, J.: Approximation of Lorenz-Optimal Solutions in Multiobjective Markov Decision Processes. In: Conference on Uncertainty in Artificial Intelligence. (2013)"},{"key":"19_CR17","unstructured":"Perny, P., Spanjaard, O.: An Axiomatic Approach to Robustness in Search Problems with Multiple Scenarios. In: Proceedings of the 19th conference on Uncertainty in Artificial Intelligence. (2003) 469\u2013476"},{"key":"19_CR18","unstructured":"Laumanns, M., Thiele, L., Zitzler, E.: An adaptive scheme to generate the Pareto front based on the epsilon-constraint method. In Branke, J., Deb, K., Miettinen, K., Steuer, R., eds.: Practical Approaches to Multi-Objective Optimization. Number 04461 in Dagstuhl Seminar Proceedings (2005)"},{"key":"19_CR19","volume-title":"Multiobjective Programming and Planning","author":"J Cohon","year":"1978","unstructured":"Cohon, J.: Multiobjective Programming and Planning. Academic Press, New York (1978)"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"Y Aneja","year":"1979","unstructured":"Aneja, Y., Nair, K.: Bicriteria transportation problem. Manage. Sci. 25, 73\u201378 (1979)","journal-title":"Manage. Sci."},{"key":"19_CR21","unstructured":"Yager, R.: On ordered weighted averaging aggregation operators in multicriteria decision making. In: IEEE Trans. Systems, Man and Cybern. Volume 18. (1998) 183\u2013190"},{"issue":"2","key":"19_CR22","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/S0377-2217(99)00240-4","volume":"122","author":"W Ogryczak","year":"2000","unstructured":"Ogryczak, W.: Inequality measures and equitable approaches to location problems. Eur. J. Oper. Res. 122(2), 374\u2013391 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"19_CR23","first-page":"260","volume":"36","author":"C Bazgan","year":"2009","unstructured":"Bazgan, C., Hugot, H., Vanderpooten, D.: Solving efficiently the 0\u20131 multi-objective knapsack problem. Computers&. Oper. Res. 36(1), 260\u2013279 (2009)","journal-title":"Oper. Res."},{"issue":"2","key":"19_CR24","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the $$k$$ shortest paths. SIAM J. Computing 28(2), 652\u2013673 (1998)","journal-title":"SIAM J. Computing"},{"key":"19_CR25","unstructured":"Jim\u00e9nez, V.M., Marzal, A.: A lazy version of Eppstein\u2019s k shortest paths algorithm. In: Proceedings of the 2Nd International Conference on Experimental and Efficient Algorithms. WEA\u201903, Berlin, Heidelberg, Springer-Verlag (2003) 179\u2013191"},{"issue":"4","key":"19_CR26","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1145\/115234.115368","volume":"38","author":"BS Stewart","year":"1991","unstructured":"Stewart, B.S., White III, C.C.: Multiobjective A*. J. ACM 38(4), 775\u2013814 (1991). October","journal-title":"J. ACM"},{"key":"19_CR27","unstructured":"Mandow, L., P\u00e9rez-De-la Cruz, J.L.: A new approach to multiobjective A* search. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence. IJCAI\u201905, San Francisco, CA, USA, Morgan Kaufmann Publishers Inc. (2005) 218\u2013223"},{"key":"19_CR28","unstructured":"Gandibleux, X., Vancoppenolle, D., Tuyttens, D.: A first making use of GRASP for solving MOCO problems. In: 14th International Conference in Multiple Criteria Decision-Making, Charlottesville (1998)"},{"key":"19_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.amc.2014.03.110","volume":"237","author":"K Florios","year":"2014","unstructured":"Florios, K., Mavrotas, G.: Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems. Appl. Math. Comput. 237, 1\u201319 (2014)","journal-title":"Appl. Math. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23114-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:24:36Z","timestamp":1653092676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23114-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231136","9783319231143"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23114-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}