Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
type: Item
instance of: scholarly article
title: Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
zbMATH Open document ID: 1349.90712
published in: Computers \& Operations Research
publication date: 2016-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6654159
zbMATH Keywords: multidimensional knapsack problem
zbMATH Keywords: core problem
zbMATH Keywords: global lifted cover inequalities
zbMATH Keywords: heuristic algorithm
author: Hanyu Gu
MaRDI profile type: Publication
full work available at URL: j.cor.2016.01.013
OpenAlex ID: W2295738984
cites work: The multidimensional 0-1 knapsack problem: an overview.
cites work: Q4821303
cites work: The multidimensional 0-1 knapsack problem -- bounds and computational aspects
cites work: A survey of effective heuristics and their application to a variety of knapsack problems
cites work: Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
cites work: A multi-level search strategy for the 0-1 multidimensional knapsack problem
cites work: New convergent heuristics for 0-1 mixed integer programming
cites work: Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
cites work: Improved results on the 0--1 multidimensional knapsack problem
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: The core concept for the Multidimensional Knapsack problem
cites work: The multidimensional knapsack problem: structure and algorithms
cites work: Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
cites work: Separation algorithms for 0-1 knapsack polytopes
cites work: Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
cites work: Q4943600
cites work: A New Algorithm for the 0-1 Knapsack Problem
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Q4178782
cites work: A geometric study of dual gaps, with applications
cites work: About Lagrangian methods in integer optimization
cites work: Geometric algorithms and combinatorial optimization
cites work: Facets of the knapsack polytope
DOI: 10.1016/J.COR.2016.01.013
description: scientific article; zbMATH DE number 6654159