Connectedness of efficient solutions in multiple objective combinatorial optimization
From MaRDI portal
Publication:650207
DOI10.1007/S10957-011-9849-8zbMATH Open1226.90090OpenAlexW1994201384MaRDI QIDQ650207FDOQ650207
Jochen Gorski, Stefan Ruzika, Kathrin Klamroth
Publication date: 25 November 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1815
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicriteria Optimization
- A survey and annotated bibliography of multiobjective combinatorial optimization
- On a multicriteria shortest path problem
- Solving efficiently the 0-1 multi-objective knapsack problem
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- An algorithm for the biobjective integer minimum cost flow problem
- On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
- Adjacency of the 0-1 knapsack problem
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
Cited In (18)
- On a biobjective search problem in a line: formulations and algorithms
- On a particular case of the multi-criteria unconstrained optimization problem
- Finding diverse ways to improve algebraic connectivity through multi-start optimization
- A note on connectivity of efficient solution sets
- Decision space robustness for multi-objective integer linear programming
- Title not available (Why is that?)
- The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem
- A multivariate analysis of the strict terminal connection problem
- Generalized multiple objective bottleneck problems
- A matheuristic for tri-objective binary integer linear programming
- On the multicriteria allocation problem
- Finding multi-objective supported efficient spanning trees
- Title not available (Why is that?)
- An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
- Greedy algorithms for a class of knapsack problems with binary weights
- Biobjective optimization problems on matroids with binary costs
- Two‐phase strategies for the bi‐objective minimum spanning tree problem
- A Survey on Multiple Objective Minimum Spanning Tree Problems
This page was built for publication: Connectedness of efficient solutions in multiple objective combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650207)
