The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem
From MaRDI portal
Publication:989830
DOI10.1007/s10288-009-0110-3zbMath1193.90178OpenAlexW2093996760MaRDI 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
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem
