Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization

In: Operations Research. Available at http://kluedo.ub.uni-kl.de/volltexte/2006/2039/, Submitted, 2006

Authors

• Jochen Gorski
• Kathrin Klamroth
• Stefan Ruzika

Abstract

Connectedness of efficient solutions is a powerful property in multiple objective combinatorial optimization since it allows the construction of the complete efficient set using neighborhood search techniques. In this paper we show that, however, most of the classical multiple objective combinatorial optimization problems do not possess the connectedness property in general, including, among others, knapsack problems (and even several special cases of knapsack problems) and linear assignment problems. We also extend already known non-connectedness results for several optimization problems on graphs like shortest path, spanning tree and minimum cost flow problems. Different concepts of connectedness are discussed in a formal setting, and numerical tests are performed for different variants of the knapsack problem to analyze the likelihood with which non-connected adjacency graphs occur in randomly generated problem instances.

BibTeX

 
@Article{ GorskiEtAl:ConnectednessSolution, 
   title = { Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization }, 
   author = { Jochen Gorski and Kathrin Klamroth and Stefan Ruzika },    
   journal = { Operations Research },           
   note = { Available at http://kluedo.ub.uni-kl.de/volltexte/2006/2039/ },  
   year = 2006, 
} 

---

This publication belongs to the project DeNDeMA.