Pages that link to "Item:Q5668263"
From MaRDI portal
The following pages link to Blocking and anti-blocking pairs of polyhedra (Q5668263):
Displayed 43 items.
- Lift-and-project ranks and antiblocker duality (Q1886795) (← links)
- Reliability, covering and balanced matrices (Q1892656) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Projective, affine, and abelian colorings of cubic graphs (Q2519796) (← links)
- A characterization of perfect graphs (Q2553372) (← links)
- Duality in mathematics and linear and integer programming (Q2565013) (← links)
- IFORS' Operational Research Hall of Fame Delbert Ray Fulkerson (Q3025051) (← links)
- A Class of Balanced Matrices Arising from Location Problems (Q3222208) (← links)
- Fractional covers for forests and matchings (Q3315281) (← links)
- On cliques associated to 3-set packing problems (Q3439164) (← links)
- Abelian Colourings of Cubic Graphs (Q3439361) (← links)
- Unions of perfect matchings in cubic graphs (Q3439362) (← links)
- Non-intersecting perfect matchings in cubic graphs (Extended abstract) (Q3439597) (← links)
- Integer Rounding for Polymatroid and Branching Optimization Problems (Q3668310) (← links)
- On box totally dual integral polyhedra (Q3717741) (← links)
- Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)
- Dual gauge programs, with applications to quadratic programming and the minimum-norm problem (Q3770288) (← links)
- Total dual integrality implies local strong unimodularity (Q3771976) (← links)
- Dynamic decomposition method for linear programming problems with ceneralized upper bounds (Q3777793) (← links)
- Lifting the facets of zero–one polytopes (Q3865839) (← links)
- (1,k)-configurations and facets for packing problems (Q3869083) (← 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)
- Some facets of the simple plant location polytope (Q3945954) (← links)
- Polynomially bounded algorithms for locatingp-centers on a tree (Q3947422) (← links)
- Finite Solution Theory for Coalitional Games (Q3958303) (← links)
- Quasi-balanced matrices (Q4060720) (← links)
- Transversal matroid intersections and related packings (Q4126086) (← links)
- Line perfect graphs (Q4141848) (← links)
- Graphs with the Circuit Cover Property (Q4305925) (← links)
- Norms and perfect graphs (Q4710897) (← links)
- Dominants and submissives of matching polyhedra (Q4726052) (← links)
- Integral decomposition in polyhedra (Q4740329) (← links)
- Properties of vertex packing and independence system polyhedra (Q4766816) (← links)
- Packing rooted directed cuts in a weighted directed graph (Q4769069) (← links)
- Perfect zero–one matrices (Q4770779) (← links)
- Blocking and antiblocking sets (Q4777078) (← links)
- A note on the blocker of tours (Q4777079) (← links)
- Precoloring Extension III: Classes of Perfect Graphs (Q4883061) (← links)
- On the facial structure of set packing polyhedra (Q5181532) (← links)
- Balanced matrices (Q5659570) (← links)
- Two-commodity cut-packing problem (Q5670477) (← links)
- Energy of convex sets, shortest paths, and resistance (Q5937247) (← links)