On packing and covering polyhedra in infinite dimensions
DOI10.1016/j.orl.2016.01.005zbMath1408.90178OpenAlexW2295287556MaRDI QIDQ1785750
Alejandro Toriello, Juan Pablo Vielma, Luis Rademacher
Publication date: 1 October 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2016.01.005
complementary slacknesscovering polyhedroninfinite linear programintegral extreme pointpacking polyhedron
Linear programming (90C05) Programming in abstract spaces (90C48) Semi-infinite programming (90C34) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On extreme infinite doubly stochastic matrices
- The Max-Flow Min-Cut theorem for countable networks
- LP duality in infinite hypergraphs
- Characterizing extreme points as basic feasible solutions in infinite linear programs
- On infinite perfect graphs and randomized stopping points on the plane
- Menger's theorem for countable graphs
- Duality in infinite dimensional linear programming
- Optimal fractional matchings and covers in infinite hypergraphs: existence and duality
- Infinite matching theory
- Strong LP duality in weighted infinite bipartite graphs
- Anti-blocking polyhedra
- Shadow Prices in Infinite-Dimensional Linear Programming
- Approximating Extreme Points of Infinite Dimensional Convex Sets
- Computing Near-Optimal Policies in Generalized Joint Replenishment
- Existence of Optimal Policies for Semi-Markov Decision Processes Using Duality for Infinite Linear Programming
- Menger's Theorem for a Countable Source Set
- König's Duality Theorem for Infinite Bipartite Graphs
- An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces
- Blocking and anti-blocking pairs of polyhedra
- Duality and Existence of Optimal Policies in Generalized Joint Replenishment
This page was built for publication: On packing and covering polyhedra in infinite dimensions
