{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T05:59:58Z","timestamp":1782539998502,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662483497","type":"print"},{"value":"9783662483503","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_25","type":"book-chapter","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T01:40:34Z","timestamp":1441071634000},"page":"288-299","source":"Crossref","is-referenced-by-count":20,"title":["Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems"],"prefix":"10.1007","author":[{"given":"Fritz","family":"B\u00f6kler","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Eppstein, D., Guibas, L.J., Henzinger, M.R.: Parametric and kinetic minimum spanning trees. In: IEEE FoCS, pp. 596\u2013605 (1998)","DOI":"10.1109\/SFCS.1998.743510"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-07557-0_3","volume-title":"Integer Programming and Combinatorial Optimization","author":"H. Aissi","year":"2014","unstructured":"Aissi, H., Mahjoub, A.R., McCormick, S.T., Queyranne, M.: A strongly polynomial time algorithm for multicriteria global minimum cuts. In: Lee, J., Vygen, J. (eds.) IPCO 2014. LNCS, vol.\u00a08494, pp. 25\u201336. Springer, Heidelberg (2014)"},{"issue":"1","key":"25_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"Y.P. Aneja","year":"1979","unstructured":"Aneja, Y.P., Nair, K.P.K.: Bicriteria transportation problem. Management Science\u00a025(1), 73\u201378 (1979)","journal-title":"Management Science"},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF02293050","volume":"8","author":"D. Avis","year":"1992","unstructured":"Avis, D., Fukuda, K.: A pivoting algorithm for convex hulls and vertex enumeration of arrangements of polyhedra. Discrete and Computational Geometry\u00a08(1), 295\u2013313 (1992)","journal-title":"Discrete and Computational Geometry"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Brunsch, T., R\u00f6glin, H.: Improved smoothed analysis of multiobjective optimization. In: ACM SToC, pp. 407\u2013426 (2012)","DOI":"10.1145\/2213977.2214016"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF02573985","volume":"10","author":"B. Chazelle","year":"1993","unstructured":"Chazelle, B.: An optimal convex hull algorithm in any fixed dimension. Discrete Computational Geometry\u00a010, 377\u2013409 (1993)","journal-title":"Discrete Computational Geometry"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M. Ehrgott","year":"2000","unstructured":"Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum\u00a022, 425\u2013460 (2000)","journal-title":"OR Spektrum"},{"key":"25_CR8","doi-asserted-by":"publisher","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 \u201couter approximation algorithm\u201d for multiple objective linear programming. Journal of Global Optimization\u00a052, 757\u2013778 (2012)","journal-title":"Journal of Global Optimization"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-61576-8_77","volume-title":"Combinatorics and Computer Science","author":"K. Fukuda","year":"1996","unstructured":"Fukuda, K., Prodon, A.: Double description method revisited. In: Deza, M., Manoussakis, I., Euler, R. (eds.) CCS 1995. LNCS, vol.\u00a01120, pp. 91\u2013111. Springer, Heidelberg (1996)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BFb0030828","volume-title":"Computing and Combinatorics","author":"J.L. Ganley","year":"1995","unstructured":"Ganley, J.L., Golin, M.J., Salowe, J.S.: The multi-weighted spanning tree problem. In: Li, M., Du, D.-Z. (eds.) COCOON 1995. LNCS, vol.\u00a0959, pp. 141\u2013150. Springer, Heidelberg (1995)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Hamel, A.H., L\u00f6hne, A., Rudloff, B.: Benson type algorithms for linear vector optimization and applications. arXiv:1302.2415 [math.OC] (July 2013)","DOI":"10.1007\/s10898-013-0098-2"},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1137\/060674831","volume":"19","author":"F. Heyde","year":"2008","unstructured":"Heyde, F., L\u00f6hne, A.: Geometric duality in multiple objective linear programming. SIAM Journal of Optimization\u00a019(2), 836\u2013845 (2008)","journal-title":"SIAM Journal of Optimization"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters\u00a027, 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-540-77120-3_53","volume-title":"Algorithms and Computation","author":"Y. Okamoto","year":"2007","unstructured":"Okamoto, Y., Uno, T.: A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 609\u2013620. Springer, Heidelberg (2007)"},{"issue":"12","key":"25_CR15","doi-asserted-by":"publisher","first-page":"2302","DOI":"10.1287\/mnsc.1100.1248","volume":"56","author":"\u00d6. \u00d6zpeynirci","year":"2010","unstructured":"\u00d6zpeynirci, \u00d6., K\u00f6ksalan, M.: An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs. Management Science\u00a056(12), 2302\u20132315 (2010)","journal-title":"Management Science"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: IEEE FoCS, pp. 86\u201392 (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"issue":"3","key":"25_CR17","doi-asserted-by":"publisher","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 Journal on Computing\u00a022(3), 371\u2013386 (2010)","journal-title":"INFORMS Journal on Computing"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0925-7721(95)00013-Y","volume":"5","author":"R. Seidel","year":"1995","unstructured":"Seidel, R.: The upper bound theorem for polytopes: an easy proof of its asymptotic version. Computational Geometry\u00a05, 115\u2013116 (1995)","journal-title":"Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T09:56:19Z","timestamp":1748598979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}