The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem

DOI10.1007/s10288-009-0110-3zbMath1193.90178MaRDI QIDQ989830

Adiel Almeida Filho, Carlos Gomes da Silva, Joao Carlos Namorado Climaco

Publication date: 23 August 2010

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-009-0110-3

zbMATH Keywords

networks; \(\{0, 1\}\) Multi-objective combinatorial optimization problems; small world measures

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C29: Multi-objective and goal programming

90C27: Combinatorial optimization

Related Items

Quasi-Newton methods for multiobjective optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectedness of efficient solutions in multiple objective combinatorial optimization
• The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study
• Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
• Solving efficiently the 0-1 multi-objective knapsack problem
• Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
• Connectedness of efficient solutions in multiple criteria combinatorial optimization
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
• A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
• Statistical mechanics of complex networks
• The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization