Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities

DOI10.1016/j.cor.2016.01.013zbMath1349.90712OpenAlexW2295738984MaRDI QIDQ342340

Han-Yu Gu

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.01.013

zbMATH Keywords

heuristic algorithmcore problemglobal lifted cover inequalitiesmultidimensional knapsack problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (1)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• About Lagrangian methods in integer optimization
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• Geometric algorithms and combinatorial optimization
• A genetic algorithm for the multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• The core concept for the Multidimensional Knapsack problem
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
• Improved results on the 0--1 multidimensional knapsack problem
• New convergent heuristics for 0-1 mixed integer programming
• 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
• Separation algorithms for 0-1 knapsack polytopes
• The Multidimensional Knapsack Problem: Structure and Algorithms
• A survey of effective heuristics and their application to a variety of knapsack problems
• A New Algorithm for the 0-1 Knapsack Problem
• An Algorithm for Large Zero-One Knapsack Problems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Facets of the knapsack polytope
• A geometric study of dual gaps, with applications

This page was built for publication: Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities