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

DOI10.1007/S10288-009-0110-3MaRDI QIDQ989830zbMATH OpenOpenAlexFDO

Authors Carlos Gomes da Silva, Adiel Almeida Filho, 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 problemssmall world measures

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1784663
• Exact algorithm for bi-objective 0-1 knapsack problem
• Connectedness of efficient solutions in multiple objective combinatorial optimization
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem

Cites work

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

Cited in

(1)

• Quasi-Newton methods for multiobjective optimization problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989830)