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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 205; číslo 2; s. 273 - 279
Hlavní autor:	Oguz, Osman
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.09.2010 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!