Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems

DOI10.1016/j.ejor.2015.01.035zbMath1346.90734OpenAlexW2153242202MaRDI QIDQ319373

Xavier Gandibleux, Anthony Przybylski, Audrey Cerqueus

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.01.035

zbMATH Keywords

combinatorial optimizationmultiple objective programmingbound setsbi-dimensional binary knapsack problemsurrogate relaxation

Mathematics Subject Classification ID

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

Related Items (3)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ On the solution of multidimensional convex separable continuous knapsack problem with bounded variables ⋮ Multi-objective branch and bound

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-directional local search
• Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
• The off-line group seat reservation problem
• A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
• Bound sets for biobjective combinatorial optimization problems
• Solving efficiently the 0-1 multi-objective knapsack problem
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
• Heuristics for the 0-1 multidimensional knapsack problem
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
• An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
• Proper efficiency and the theory of vector maximization
• The multiobjective multidimensional knapsack problem: a survey and a new approach
• The Multidimensional Knapsack Problem: Structure and Algorithms
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• A survey of effective heuristics and their application to a variety of knapsack problems
• Implementation of Multiobjective Memetic Algorithms for Combinatorial Optimization Problems: A Knapsack Problem Case Study
• Bicriteria Transportation Problem
• Surrogate Constraint Duality in Mathematical Programming
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Multicriteria Optimization

This page was built for publication: Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems