Cutting planes for mixed-integer knapsack polyhedra

DOI10.1007/BF01581108zbMATH Open0919.90115MaRDI QIDQ1290620FDOQ1290620

Authors: Xiao-Qing Yan, E. Andrew Boyd 

Publication date: 3 June 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Recommendations

• A cutting plane method for knapsack polytope
• On the exact separation of mixed integer knapsack cuts
• Generating Fenchel Cutting Planes for Knapsack Polyhedra
• On the facets of the mixed-integer knapsack polyhedron
• Solving Multiple Knapsack Problems by Cutting Planes

zbMATH Keywords

cutting planesmixed-integer knapsack polyhedra

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

• Solving Large-Scale Zero-One Linear Programming Problems
• Fenchel Cutting Planes for Integer Programs
• A note on the knapsack problem with special ordered sets
• Generating Fenchel Cutting Planes for Knapsack Polyhedra
• On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut

Cited In (7)

• A cutting plane method for knapsack polytope
• Solving Multiple Knapsack Problems by Cutting Planes
• Knapsack polytopes: a survey
• Generating Fenchel Cutting Planes for Knapsack Polyhedra
• On the Exact Separation of Mixed Integer Knapsack Cuts
• An implementation of exact knapsack separation
• On the exact separation of mixed integer knapsack cuts

Uses Software

• MINTO

This page was built for publication: Cutting planes for mixed-integer knapsack polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290620)