Revisiting surrogate relaxation for the multidimensional knapsack problem

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Reducibility among Combinatorial Problems
Geometric algorithms and combinatorial optimization
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
The multidimensional knapsack problem: structure and algorithms
Surrogate Mathematical Programming
Kernel search: a general heuristic for the multi-dimensional knapsack problem
Heuristics for the 0-1 multidimensional knapsack problem
A genetic algorithm for the multidimensional knapsack problem
An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
The multidimensional 0-1 knapsack problem: an overview.
Surrogate Constraint Duality in Mathematical Programming
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
On the complexity of the surrogate dual of 0–1 programming
A heuristic solution procedure for the multiconstraint zero-one knapsack problem
The multidimensional 0-1 knapsack problem -- bounds and computational aspects
A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
On The Strength Of Relaxations Of Multidimensional Knapsack Problems
Title not available (Why is that?)
Surrogate Dual Multiplier Search Procedures in Integer Programming
Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
Title not available (Why is that?)
CORAL: an exact algorithm for the multidimensional knapsack problem
A trust region method for the solution of the surrogate dual in integer programming
On the complexity of surrogate and group relaxation for integer linear programs

Cited In (4)

Title not available (Why is that?)
Matheuristics: survey and synthesis
A Lagrangian dual and surrogate method for multi-dimensional quadratic knapsack problems
Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions

Uses Software

OR-Library

This page was built for publication: Revisiting surrogate relaxation for the multidimensional knapsack problem

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