{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:47:37Z","timestamp":1725497257405},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77120-3_53","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:31:09Z","timestamp":1196940669000},"page":"609-620","source":"Crossref","is-referenced-by-count":1,"title":["A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization"],"prefix":"10.1007","author":[{"given":"Yoshio","family":"Okamoto","sequence":"first","affiliation":[]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Applied Mathematics\u00a065, 21\u201346 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"53_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1080\/02331939608844238","volume":"38","author":"M. Ehrgott","year":"1996","unstructured":"Ehrgott, M.: On matroids with multiple objectives. Optimization\u00a038, 73\u201384 (1996)","journal-title":"Optimization"},{"key":"53_CR3","volume-title":"Multicriteria Optimization","author":"M. Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Heidelberg (2005)","edition":"2"},{"key":"53_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, 2nd edn. Springer, Berlin New York (1993)","edition":"2"},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V.: Generating all vertices of a polyhedron is hard. In: Proc. 17th SODA. Full version to appear in Discrete & Computational Geometry, pp. 758\u2013765 (2006)","DOI":"10.1145\/1109557.1109640"},{"key":"53_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-3-540-30559-0_3","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S.-I. Nakano","year":"2004","unstructured":"Nakano, S.-I., Uno, T.: Constant time generation of trees with specified diameter. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 33\u201345. Springer, Heidelberg (2004)"},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proc. 41st FOCS, pp. 86\u201392 (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"key":"53_CR8","first-page":"149","volume":"20","author":"E.L. Ulungu","year":"1995","unstructured":"Ulungu, E.L., Teghem, J.: The two phase method: an efficient procedure to solve bi-objective combinatorial optimization problems. Foundations of Computing and Decision Sciences\u00a020, 149\u2013165 (1995)","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"53_CR9","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)","edition":"2"},{"key":"53_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/11571155_5","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"C. Zaroliagis","year":"2005","unstructured":"Zaroliagis, C.: Recent advances in multiobjective optimization. In: Lupanov, O.B., Kasim-Zade, O.M., Chaskin, A.V., Steinh\u00f6fel, K. (eds.) SAGA 2005. LNCS, vol.\u00a03777, pp. 45\u201347. Springer, Heidelberg (2005)"},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Laumanns, M., Bleuler, S.: A tutorial on evolutionary multiobjective optimization. In: Gandibleux, X., Sevaux, M., S\u00f6rensen, K., T\u2019kindt, V. (eds.) Metaheuristics for Multiobjective Optimisation, Lecture Notes in Economics and Mathematical Systems, vol.\u00a0535, pp. 3\u201338 (2004)","DOI":"10.1007\/978-3-642-17144-4_1"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:01:19Z","timestamp":1619521279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771180"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_53","relation":{},"subject":[]}}