New Bounds for the Integer Carathéodory Rank
From MaRDI portal
Publication:6136661
DOI10.1137/23m1561312arXiv2211.03150MaRDI QIDQ6136661
Mark J. Hogan, Iskander M. Aliev, Martin Henk, Timm Oertel, Stefan Kuhlmann
Publication date: 17 January 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.03150
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-standard approaches to integer programming
- Polyhedra with the integer Carathéodory property
- Integer program with bimodular matrix
- An integer analogue of Carathéodory's theorem
- On total dual integrality
- Improved bound for the Carathéodory rank of the bases of a matroid
- Weighted projective spaces and reflexive simplices
- Detecting the integer decomposition property and Ehrhart unimodality in reflexive simplices
- Sparse representation of vectors in lattices and semigroups
- Improving the Cook et al. proximity bound given integral valued constraints
- Carathéodory bounds for integer cones
- Normal polytopes: between discrete, continuous, and random
- On the foundations of linear and integer linear programming I
- Some Basis Theorems for Integral Monoids
- Normality and covering properties of affine semigroups
- A counterexample to an integer analogue of Carathéodory's theorem
- A strongly polynomial algorithm for bimodular integer linear programming
- On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases
- Sparse Solutions of Linear Diophantine Equations
- On sub-determinants and the diameter of polyhedra
