Cutting plane algorithms for 0-1 programming based on cardinality cuts
Date
2010
Authors
Oguz, O.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
European Journal of Operational Research
Print ISSN
0377-2217
Electronic ISSN
1872-6860
Publisher
Elsevier
Volume
205
Issue
2
Pages
273 - 279
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
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.