Pages that link to "Item:Q1122478"

The following pages link to A generalization of antiwebs to independence systems and their canonical facets (Q1122478):

Displaying 20 items.

• Implicit cover inequalities (Q266036) (← links)
• A polyhedral investigation of star colorings (Q284838) (← links)
• Strong formulation for the spot 5 daily photograph scheduling problem (Q613663) (← links)
• The anti-join composition and polyhedra (Q688264) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
• Minimum partition of an independence system into independent sets (Q1013303) (← links)
• Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
• Rank inequalities and separation algorithms for packing designs and sparse triple systems. (Q1401311) (← links)
• Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
• On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
• The \(k\)-regular induced subgraph problem (Q1786867) (← links)
• Applying Lehman's theorems to packing problems (Q1919808) (← links)
• On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
• Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
• Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model (Q2940542) (← links)
• Transitive packing (Q4645940) (← links)
• (Q5708566) (← links)
• Tilted inequalities and facets of the set covering polytope: a theoretical analysis (Q6611016) (← links)