Cutting Plane Algorithms for 0-1 Programming Based on Cardinality Cuts
Abstract: Abstract: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by their revision and use in integer programming as a new generation of cuts that excludes not only portions of polyhedra containing noninteger points, also parts with some integer points that have been explored in search of an optimal solution. Our computational experimentations demonstrate that this new approach has significant potential for solving large scale integer programming problems.
Keywords: 0-1 integer programming, valid inequalities, cutting planes.
Category 1: Integer Programming
Category 2: Integer Programming (0-1 Programming )
Category 3: Integer Programming (Cutting Plane Approaches )
Citation: Dept. of Industrial Engineering, Bilkent University, 11/08
Entry Submitted: 11/06/2008
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|