On separating cover inequalities for the multidimensional knapsack problem
type: Item
instance of: scholarly article
title: On separating cover inequalities for the multidimensional knapsack problem
zbMATH Open document ID: 1159.90460
author: Osman Oguz
author: Tolga Bektaş
published in: Computers \& Operations Research
publication date: 2007-01-09T00:00:00Z
full work available at URL: http://hdl.handle.net/11693/11441
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5082745
zbMATH Keywords: integer programming
zbMATH Keywords: cover inequalities
zbMATH Keywords: separation problem
MaRDI profile type: Publication
OpenAlex ID: W2139189498
cites work: Q4821303
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
cites work: Q4054818
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
DOI: 10.1016/J.COR.2005.05.032
Recommended article: A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
Recommended article: Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
Recommended article: Multi-cover inequalities for totally-ordered multiple knapsack sets
Recommended article: Lifting the knapsack cover inequalities for the knapsack polytope
Recommended article: Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
Recommended article: On the complexity of sequentially lifting cover inequalities for the knapsack polytope
Recommended article: Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
Recommended article: On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
Recommended article: Lifting cover inequalities for the precedence-constrained knapsack problem
Recommended article: Simple lifted cover inequalities and hard knapsack problems
description: scientific article; zbMATH DE number 5082745