Set packing relaxations of some integer programs
From MaRDI portal
Publication:1587935
DOI10.1007/S101070000154zbMATH Open1018.90028MaRDI QIDQ1587935FDOQ1587935
Robert Weismantel, Ralf Borndörfer
Publication date: 3 December 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
combinatorial optimizationinteger programmingcutting planespolyhedral combinatoricscutslinear orderingsmulticutsacyclic digraphsset packing relaxationsset packings
Cited In (16)
- Upper bounds on the average number of iterations for some algorithms of solving the set packing problem
- Strengthened clique-family inequalities for the stable set polytope
- Facets from gadgets
- A combinatorial study of partial order polytopes
- Discrete relaxations of combinatorial programs
- A two-level graph partitioning problem arising in mobile wireless communications
- A computational study of a cutting plane algorithm for university course timetabling
- On the mixed set covering, packing and partitioning polytope
- Projection results for the \(k\)-partition problem
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
- The biorder polytope
- 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
- Node-Packing Problems with Integer Rounding Properties
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs
- On the combinatorial structure of the approval-voting polytope
Uses Software
This page was built for publication: Set packing relaxations of some integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587935)
