Set packing relaxations of some integer programs
From MaRDI portal
Publication:1587935
Recommendations
Cited in
(16)- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
- A two-level graph partitioning problem arising in mobile wireless communications
- Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint
- On the combinatorial structure of the approval-voting polytope
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs
- Projection results for the \(k\)-partition problem
- Facets from gadgets
- A computational study of a cutting plane algorithm for university course timetabling
- Upper bounds on the average number of iterations for some algorithms of solving the set packing problem
- Node-Packing Problems with Integer Rounding Properties
- A combinatorial study of partial order polytopes
- Discrete relaxations of combinatorial programs
- Strengthened clique-family inequalities for the stable set polytope
- The biorder polytope
- On the mixed set covering, packing and partitioning polytope
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
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)