Set packing relaxations of some integer programs
From MaRDI portal
Publication:1587935
DOI10.1007/s101070000154zbMath1018.90028MaRDI QIDQ1587935
Ralf Borndörfer, Robert Weismantel
Publication date: 3 December 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
integer programmingcombinatorial optimizationmulticutscutting planesacyclic digraphspolyhedral combinatoricscutslinear orderingsset packing relaxationsset packings
Related Items
A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem, Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint, A computational study of a cutting plane algorithm for university course timetabling, Facets from gadgets, A two-level graph partitioning problem arising in mobile wireless communications, On the mixed set covering, packing and partitioning polytope, Projection results for the \(k\)-partition problem, The biorder polytope, Discrete relaxations of combinatorial programs, Facets of the linear ordering polytope: a unification for the fence family through weighted graphs, Strengthened clique-family inequalities for the stable set polytope, A combinatorial study of partial order polytopes, On the combinatorial structure of the approval-voting polytope, A fast algorithm for minimum weight odd circuits and cuts in planar graphs
Uses Software
