Pages that link to "Item:Q1123808"

The following pages link to Facets and lifting procedures for the set covering polytope (Q1123808):

Displaying 18 items.

• Generalized minor inequalities for the set covering polyhedron related to circulant matrices (Q299092) (← links)
• Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
• The anti-join composition and polyhedra (Q688264) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• A branch-and-cut algorithm for the continuous error localization problem in data cleaning (Q875426) (← links)
• The nonidealness index of rank-ideal matrices (Q987680) (← links)
• Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
• On the set covering polyhedron of circulant matrices (Q1015320) (← links)
• Polyhedra associated with identifying codes in graphs (Q1752479) (← links)
• Requiring connectivity in the set covering problem (Q1774524) (← links)
• Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516) (← links)
• On the dominating set polytope (Q2426444) (← links)
• How to recycle your facets (Q2506820) (← links)
• Some advances on the set covering polyhedron of circulant matrices (Q2636828) (← links)
• A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
• (Q2861548) (← links)
• Transitive packing (Q4645940) (← links)
• Tilted inequalities and facets of the set covering polytope: a theoretical analysis (Q6611016) (← links)