On the exact separation of mixed integer knapsack cuts
type: Item
instance of: scholarly article
title: On the exact separation of mixed integer knapsack cuts
zbMATH Open document ID: 1218.90126
author: Ricardo Fukasawa
author: Marcos Goycoolea
published in: Mathematical Programming. Series A. Series B
publication date: 2011-06-17T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5909172
zbMATH Keywords: cutting plane algorithms
zbMATH Keywords: mixed integer knapsack problem
zbMATH Keywords: mixed integer programming
describes a project that uses: CPLEX
describes a project that uses: MIPLIB2003
describes a project that uses: MIPLIB
describes a project that uses: gmp
MaRDI profile type: Publication
full work available at URL: s10107-009-0284-7
OpenAlex ID: W2051496747
cites work: Unbounded knapsack problem: Dynamic programming revisited
cites work: Q4735941
cites work: Exact solutions to linear programming problems
cites work: On the facets of the mixed-integer knapsack polyhedron
cites work: Sequence Independent Lifting for Mixed-Integer Programming
cites work: A computational study of exact knapsack separation for the generalized assignment problem
cites work: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
cites work: Optimizing over the split closure
cites work: Facets of the Knapsack Polytope From Minimal Covers
cites work: Q3241581
cites work: Projected Chvátal-Gomory cuts for mixed integer linear programs
cites work: Fenchel Cutting Planes for Integer Programs
cites work: Chvátal closures for mixed integer programming problems
cites work: \(k\)-cuts: a variation of Gomory mixed integer cuts from the LP tableau
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: On the strength of Gomory mixed-integer cuts as group cuts
cites work: On the MIR Closure of Polyhedra
cites work: Benchmarking optimization software with performance profiles.
cites work: A linear algorithm for integer programming in the plane
cites work: On the knapsack closure of 0-1 integer linear programs
cites work: Optimizing over the first Chvátal closure
cites work: A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts
cites work: A new dominance procedure for combinatorial optimization problems
cites work: Early Integer Programming
cites work: Some continuous functions related to corner polyhedra
cites work: Sequence independent lifting in mixed integer programming
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: The Power of Dominance Relations in Branch-and-Bound Algorithms
cites work: A Polynomial Algorithm for the Two-Variable Integer Programming Problem
cites work: Separation algorithms for 0-1 knapsack polytopes
cites work: Q4821303
cites work: Aggregation and Mixed Integer Rounding to Solve MIPs
cites work: Q3993418
cites work: A recursive procedure to generate all cuts for 0-1 mixed integer programs
cites work: Q4943600
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: Production Sets with Indivisibilities, Part II: The Case of Two Activities
cites work: Technical Note—Facets and Strong Valid Inequalities for Integer Programs
cites work: Cutting planes for mixed-integer knapsack polyhedra
cites work: Lifting the facets of zero–one polytopes
DOI: 10.1007/S10107-009-0284-7
description: scientific article; zbMATH DE number 5909172