Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
From MaRDI portal
Recommendations
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
- A hybrid dynamic programming approach to the biobjective binary knapsack problem
- scientific article; zbMATH DE number 1784662
- Bound sets for biobjective combinatorial optimization problems
Cites work
- scientific article; zbMATH DE number 5726469 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1149800 (Why is no real title available?)
- scientific article; zbMATH DE number 1784662 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
- A survey of effective heuristics and their application to a variety of knapsack problems
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- Bicriteria Transportation Problem
- Bound sets for biobjective combinatorial optimization problems
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- Heuristics for the 0-1 multidimensional knapsack problem
- Implementation of Multiobjective Memetic Algorithms for Combinatorial Optimization Problems: A Knapsack Problem Case Study
- Multi-directional local search
- Multicriteria Optimization
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- Proper efficiency and the theory of vector maximization
- Solving efficiently the 0-1 multi-objective knapsack problem
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Surrogate Constraint Duality in Mathematical Programming
- The multidimensional 0-1 knapsack problem: an overview.
- The multidimensional knapsack problem: structure and algorithms
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- The off-line group seat reservation problem
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
Cited in
(7)- On the strength of Lagrangian duality in multiobjective integer programming
- Relaxations and duality for multiobjective integer programming
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Multi-objective branch and bound
- Parallel implementation of an exact two-phase method for the biobjective knapsack problem
- A surrogate-based heuristic for production planning problem of orders in small foundries
This page was built for publication: Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319373)
