Quick evaluation of the efficient solution set for the biobjective knapsack problem

MaRDI QIDQ4546413zbMATH OpenFDO

Authors Xavier Gandibleux

Publication date 15 September 2003

zbMATH Keywords

decision space reduction techniquesmultiobjective combinatorial optimizationmultiobjective metaheuristics

Mathematics Subject Classification ID

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

Recommendations

• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Solving efficiently the 0-1 multi-objective knapsack problem
• Approximating multiobjective knapsack problems
• Exact algorithm for bi-objective 0-1 knapsack problem

Cited in

(5)

• Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
• The multiobjective multidimensional knapsack problem: a survey and a new approach
• New reduction strategy in the biobjective knapsack problem
• The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem

This page was built for publication: Quick evaluation of the efficient solution set for the biobjective knapsack problem

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