Revisiting surrogate relaxation for the multidimensional knapsack problem

DOI10.1016/j.orl.2022.10.003OpenAlexW4306803827MaRDI QIDQ2102833

Trivikram Dokka, M. Hasan Mansoor, Adam N. Letchford

Publication date: 12 December 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2022.10.003

zbMATH Keywords

integer programmingknapsack problemssurrogate relaxation

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Matheuristics: survey and synthesis

Uses Software

• OR-Library

Cites Work

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

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