A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
type: Item
instance of: scholarly article
title: A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
zbMATH Open document ID: 1049.90074
DOI: 10.1016/S0167-6377(02)00124-4
published in: Operations Research Letters
publication date: 2003-04-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1892202
author: V. Gabrel
author: Michel Minoux
describes a project that uses: CPLEX
describes a project that uses: OR-Library
describes a project that uses: MINTO
MaRDI profile type: Publication
cites work: Facets of the knapsack polytope
cites work: Canonical Cuts on the Unit Hypercube
cites work: Facets of the Knapsack Polytope From Minimal Covers
cites work: Q3340498
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: On The Strength Of Relaxations Of Multidimensional Knapsack Problems
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: On tightening cover induced inequalities
cites work: Efficient reformulation for 0-1 programs -- methods and computational results
cites work: On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
cites work: Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
cites work: An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
cites work: Exact solution of multicommodity network optimization problems with general step cost functions
cites work: Surrogate Constraints in Integer Programming
cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
cites work: Dioïds and semirings: Links to fuzzy sets and other applications
cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
cites work: Q5734003
cites work: Q3993418
cites work: Combinatorial Optimization with Rational Objective Functions
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: MINTO, a Mixed INTeger Optimizer
cites work: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
cites work: (1,k)-configurations and facets for packing problems
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
cites work: Solving Mixed Integer Programming Problems Using Automatic Reformulation
cites work: Solving Multiple Knapsack Problems by Cutting Planes
full work available at URL: s0167-6377(02)00124-4
OpenAlex ID: W2000043213
description: scientific article; zbMATH DE number 1892202