{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:38:22Z","timestamp":1759667902533},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,4,22]],"date-time":"2011-04-22T00:00:00Z","timestamp":1303430400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s10957-011-9849-8","type":"journal-article","created":{"date-parts":[[2011,4,21]],"date-time":"2011-04-21T16:16:18Z","timestamp":1303402578000},"page":"475-497","source":"Crossref","is-referenced-by-count":17,"title":["Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization"],"prefix":"10.1007","volume":"150","author":[{"given":"Jochen","family":"Gorski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kathrin","family":"Klamroth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Ruzika","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,22]]},"reference":[{"key":"9849_CR1","doi-asserted-by":"crossref","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 22, 425\u2013460 (2000)","journal-title":"OR Spektrum"},{"key":"9849_CR2","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, 711\u2013725 (1977)","journal-title":"Oper. Res. Q."},{"key":"9849_CR3","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF00932907","volume":"25","author":"P. Naccache","year":"1978","unstructured":"Naccache, P.: Connectedness of the set of nondominated outcomes. J. Optim. Theory Appl. 25, 459\u2013467 (1978)","journal-title":"J. Optim. Theory Appl."},{"key":"9849_CR4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01102345","volume":"65","author":"S. Helbig","year":"1990","unstructured":"Helbig, S.: On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces. J. Optim. Theory Appl. 65, 257\u2013271 (1990)","journal-title":"J. Optim. Theory Appl."},{"key":"9849_CR5","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"E.Q.V. Martins","year":"1984","unstructured":"Martins, E.Q.V.: On a multicriteria shortest path problem. Eur. J. Oper. Res. 16, 236\u2013245 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"9849_CR6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0377-2217(96)00116-6","volume":"97","author":"M. Ehrgott","year":"1997","unstructured":"Ehrgott, M., Klamroth, K.: Connectedness of efficient solutions in multiple criteria combinatorial optimization. Eur. J. Oper. Res. 97, 159\u2013166 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"9849_CR7","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1016\/j.cor.2004.11.001","volume":"33","author":"A. Przybylski","year":"2006","unstructured":"Przybylski, A., Gandibleux, X., Ehrgott, M.: The biobjective integer minimum cost flow problem\u2014incorrectness of Sede\u00f1o-Noda and Gonz\u00e1lez-Mart\u00edn\u2019s algorithm. Comput. Oper. Res. 33, 1459\u20131463 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9849_CR8","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0305-0548(99)00095-7","volume":"28","author":"A. Sede\u00f1o-Noda","year":"2001","unstructured":"Sede\u00f1o-Noda, A., Gonz\u00e1lez-Mart\u00edn, C.: An algorithm for the biobjective integer minimum cost flow problem. Comput. Oper. Res. 28, 139\u2013156 (2001)","journal-title":"Comput. Oper. Res."},{"key":"9849_CR9","unstructured":"Pedersen, C.R.: Multicriteria discrete optimization\u2014and related topics. Ph.D. Thesis, University of Aarhus, Denmark (2006)"},{"key":"9849_CR10","unstructured":"da Silva, C.G., Cl\u00edmaco, J., Figueira, J.: Geometrical configuration of the Pareto frontier of bi-criteria {0,1}-knapsack problems. Working paper 16-2004, Institute for Systems and Computers Engineering, Coimbra, Portugal (2004)"},{"key":"9849_CR11","volume-title":"Multiple Objective Optimization and Implications for Single Objective Optimization","author":"J. Gorski","year":"2010","unstructured":"Gorski, J.: Multiple Objective Optimization and Implications for Single Objective Optimization. Shaker Verlag, Aachen (2010)"},{"key":"9849_CR12","first-page":"198","volume-title":"39th Annual ORSNZ Conference","author":"M. O\u2019Sullivan","year":"2004","unstructured":"O\u2019Sullivan, M., Walker, C.: Connecting efficient knapsacks\u2014experiments with the equally-weighted bi-criteria knapsack problem. In: 39th Annual ORSNZ Conference, University of Auckland, Auckland, New Zealand, pp.\u00a0198\u2013207 (2004)"},{"key":"9849_CR13","series-title":"LNCS","volume-title":"11th European Conference on Evolutionary Computation in Combinatorial Optimisation","author":"A. Liefooghe","year":"2011","unstructured":"Liefooghe, A., Paquete, L., Sim\u00f5es, M., Figueira, J.R.: Connectedness and local search for bicriteria knapsack problems. In: 11th European Conference on Evolutionary Computation in Combinatorial Optimisation. LNCS. Springer, Berlin (2011)"},{"key":"9849_CR14","series-title":"Lecture Notes in Economics and Mathematical Systems","volume-title":"Metaheuristics for Multiobjective Optimisation","author":"L. Paquete","year":"2004","unstructured":"Paquete, L., Chiarandini, M., St\u00fctzle, T.: Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study. In: Gandibleux, X., Sevaux, M., Srensen, K., T\u2019kindt, V. (eds.) Metaheuristics for Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0535. Springer, Berlin (2004)"},{"key":"9849_CR15","volume-title":"7th International Conference on Multi-Objective Programming and Goal Programming","author":"L. Paquete","year":"2006","unstructured":"Paquete, L., St\u00fctzle, T.: Clusters of nondominated solutions in multiobjective combinatorial optimization. In: 7th International Conference on Multi-Objective Programming and Goal Programming, Tours, France (2006)"},{"key":"9849_CR16","volume-title":"Multiple Criteria Optimization. Theory, Computation, and Application","author":"R. Steuer","year":"1985","unstructured":"Steuer, R.: Multiple Criteria Optimization. Theory, Computation, and Application. Wiley, New York (1985)"},{"key":"9849_CR17","volume-title":"Multicriteria Optimization","author":"M. Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2005)"},{"key":"9849_CR18","unstructured":"Gorski, J.: Analysis of the connectedness of Pareto-optimal solutions in multiple criteria combinatorial optimization. M.S. Thesis, University of Erlangen-Nuremberg, Germany (2004)"},{"issue":"8","key":"9849_CR19","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/0305-0548(92)90019-2","volume":"19","author":"D. Geist","year":"1992","unstructured":"Geist, D., Rodin, E.Y.: Adjacency of the 0-1 knapsack problem. Comput. Oper. Res. 19(8), 797\u2013800 (1992)","journal-title":"Comput. Oper. Res."},{"key":"9849_CR20","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1137\/1016083","volume":"16","author":"M.L. Balinski","year":"1974","unstructured":"Balinski, M.L., Russakoff, A.: On the assignment polytope. SIAM Rev. 16, 516\u2013525 (1974)","journal-title":"SIAM Rev."},{"key":"9849_CR21","volume-title":"Adjacency on Polytopes in Combinatorial Optimization","author":"D. Hausmann","year":"1980","unstructured":"Hausmann, D.: Adjacency on Polytopes in Combinatorial Optimization. Verlag Anton Hain, K\u00f6nigstein\/Ts (1980)"},{"issue":"1","key":"9849_CR22","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/(SICI)1520-6750(200002)47:1<57::AID-NAV4>3.0.CO;2-4","volume":"47","author":"K. Klamroth","year":"2000","unstructured":"Klamroth, K., Wiecek, M.: Dynamic programming approaches to the multiple criteria knapsack problem. Nav. Res. Logist. 47(1), 57\u201376 (2000)","journal-title":"Nav. Res. Logist."},{"issue":"1","key":"9849_CR23","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.cor.2007.09.009","volume":"36","author":"C. Bazgan","year":"2009","unstructured":"Bazgan, C., Hugot, H., Vanderpooten, D.: Solving efficiently the 0-1 multi-objective knapsack problem. Comput. Oper. Res. 36(1), 260\u2013279 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9849_CR24","unstructured":"Pedersen, C.R., Nielsen, L.R., Andersen, K.A.: On the bicriterion multi modal assignment problem. Working paper WP-2005-3, Department of Operations Research, University of Aarhus (2005)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-011-9849-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-011-9849-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-011-9849-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:55:11Z","timestamp":1559469311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-011-9849-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,22]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["9849"],"URL":"https:\/\/doi.org\/10.1007\/s10957-011-9849-8","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2011,4,22]]}}}