Pages that link to "Item:Q1587935"

The following pages link to Set packing relaxations of some integer programs (Q1587935):

Displaying 14 items.

• A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem (Q342319) (← links)
• A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970) (← links)
• A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
• A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
• On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
• Projection results for the \(k\)-partition problem (Q1751250) (← links)
• The biorder polytope (Q1765958) (← links)
• A combinatorial study of partial order polytopes (Q1867280) (← links)
• On the combinatorial structure of the approval-voting polytope (Q1867363) (← links)
• Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
• Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint (Q2177831) (← links)
• Facets from gadgets (Q2220662) (← links)
• Facets of the linear ordering polytope: a unification for the fence family through weighted graphs (Q2497757) (← links)
• Discrete relaxations of combinatorial programs (Q5946814) (← links)