Cutting plane algorithms for 0-1 programming based on cardinality cuts

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 conta...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 205; no. 2; pp. 273 - 279
Main Author:	Oguz, Osman
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.09.2010 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	0-1 Integer programming 0-1 Integer programming Valid inequalities Cutting planes Applied sciences Cutting planes Cutting stock problem Exact sciences and technology Integer programming Mathematical programming Operational research and scientific management Operational research. Management science Optimization algorithms Studies Valid inequalities Cutting planes 0-1 Integer programming Valid inequalities Polyhedron Integer programming Zero one programming Cutting plane method Cut generation Large scale system
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!