Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis

DOI10.1007/978-3-540-85646-7_7zbMath1176.90512OpenAlexW1497333074MaRDI QIDQ3649591

Luís Paquete, Thomas Stützle

Publication date: 4 December 2009

Published in: Multiobjective Programming and Goal Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85646-7_7

zbMATH Keywords

combinatorial optimizationmultiobjective programminglocal search

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (3)

Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem ⋮ Two-phase Pareto local search for the biobjective traveling salesman problem ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A parametric approach to solving bicriterion shortest path problems
• A review of metrics on permutations for search landscape analysis
• Connectedness of efficient solutions in multiple criteria combinatorial optimization
• On spanning tree problems with multiple objectives
• On bicriterion minimal spanning trees: An approximation

This page was built for publication: Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis