Cutting planes for mixed-integer knapsack polyhedra

DOI10.1007/BF01581108zbMath0919.90115MaRDI QIDQ1290620

Xiao-Qing Yan, E. Andrew Boyd

Publication date: 3 June 1999

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

zbMATH Keywords

cutting planesmixed-integer knapsack polyhedra

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (2)

Knapsack polytopes: a survey ⋮ On the exact separation of mixed integer knapsack cuts

Uses Software

• MINTO

Cites Work

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

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