A Discrete Convex Min-Max Formula for Box-TDI Polyhedra
From MaRDI portal
Publication:5085130
DOI10.1287/moor.2021.1160zbMath1489.90152arXiv2007.03507OpenAlexW3205139275WikidataQ113749916 ScholiaQ113749916MaRDI QIDQ5085130
Publication date: 27 June 2022
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.03507
total dual integralitymin-max formuladiscrete convex function\(M\)-convex setcombinatorial inverse problemintegral base-polyhedron
Related Items
Discrete Fenchel duality for a pair of integrally convex and separable convex functions, Recent progress on integrally convex functions, Note on the polyhedral description of the Minkowski sum of two L-convex sets, Inverse optimization problems with multiple weight functions
Cites Work
- A min-max relation for the partial q-colourings of a graph. II: Box perfection
- An integer analogue of Carathéodory's theorem
- Discrete convex analysis
- Operations that preserve total dual integrality
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Box-total dual integrality, box-integrality, and equimodular matrices
- A simple algorithm and min-max formula for the inverse arborescence problem
- On box totally dual integral polyhedra
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- Discrete Convex Analysis
- Matroids and the greedy algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
