k-Disjunctive cuts and a finite cutting plane algorithm for general mixed integer linear programs

Simple item page
dc.creatorJörg, Markus
dc.date2007-07-26
dc.date.accessioned2026-07-07T08:20:29Z
dc.date.available2026-07-07T08:20:29Z
dc.descriptionIn this paper we give a generalization of the well known split cuts of Cook, Kannan and Schrijver to cuts which are based on multi-term disjunctions. They will be called k-disjunctive cuts. The starting point is the question what kind of cuts is needed for a finite cutting plane algorithm for general mixed integer programs. We will deal with this question in detail and derive cutting planes based on k-disjunctions related to a given cut vector. Finally we will show how a finite cutting plane algorithm can be established using these cuts in combination with Gomory mixed integer cuts.
dc.description18 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0707.3945
dc.identifierhttp://arxiv.org/abs/0707.3945
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135087
dc.subjectOptimization and Control
dc.subject90C11
dc.titlek-Disjunctive cuts and a finite cutting plane algorithm for general mixed integer linear programs
dc.typetext

Files

Collections

arXiv