The following pages link to Anti-blocking polyhedra (Q2549326):
Displaying 41 items.
- Balanced matrices (Q2433704) (← links)
- A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
- Kőnig's edge-colouring theorem for all graphs (Q2450735) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- Normal hypergraphs and the perfect graph conjecture. (Reprint) (Q2497986) (← links)
- Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint) (Q2497988) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- Normal hypergraphs and the perfect graph conjecture (Q2553445) (← links)
- Edmonds polytopes and a hierarchy of combinatorial problems (Q2557712) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2857431) (← links)
- On the Chvàtal-rank of antiwebs (Q2883565) (← links)
- On the Chvátal rank of linear relaxations of the stable set polytope (Q3002564) (← links)
- On perfect graphs and polyhedra with (0, 1)-valued extreme points (Q3208440) (← links)
- Integer Rounding for Polymatroid and Branching Optimization Problems (Q3668310) (← links)
- Synthesis of directed multicommodity flow networks (Q3712097) (← links)
- Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)
- Connected and alternating vectors: Polyhedra and algorithms (Q3895223) (← links)
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles (Q3899836) (← links)
- Finite checkability for integer rounding properties in combinatorial programming problems (Q3929541) (← links)
- On the use of penumbras in blocking and antiblocking theory (Q3931051) (← links)
- Computing low-capacity 0–1 knapsack polytopes (Q3958269) (← links)
- Determining the number of internal stability of a graph (Q3960887) (← links)
- Semiantichains and Unichain Coverings in Direct Products of Partial Orders (Q3966188) (← links)
- An algorithm for the maximum internally stable set in a weighted graph (Q3968462) (← links)
- Vertex packings: Structural properties and algorithms (Q4074668) (← links)
- 2-Matchings and 2-covers of hypergraphs (Q4106238) (← links)
- Line perfect graphs (Q4141848) (← links)
- Norms and perfect graphs (Q4710897) (← links)
- Properties of vertex packing and independence system polyhedra (Q4766816) (← links)
- Packing rooted directed cuts in a weighted directed graph (Q4769069) (← links)
- Blocking and antiblocking sets (Q4777078) (← links)
- Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming (Q5013579) (← links)
- Non-interfering network flows (Q5056145) (← links)
- $t$-Perfection in $P_5$-Free Graphs (Q5348215) (← links)
- A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant (Q5458540) (← links)
- Blocking and anti-blocking pairs of polyhedra (Q5668263) (← links)
- Geometric inequalities for anti-blocking bodies (Q5886677) (← links)
- Energy of convex sets, shortest paths, and resistance (Q5937247) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)
- Underlying flag polymatroids (Q6608017) (← links)
- A weak box-perfect graph theorem (Q6615760) (← links)
