The Width and Integer Optimization on Simplices With Bounded Minors of the Constraint Matrices
Optimization and Control
2022-11-30 v1 Computational Complexity
Abstract
In this paper, we will show that the width of simplices defined by systems of linear inequalities can be computed in polynomial time if some minors of their constraint matrices are bounded. Additionally, we present some quasi-polynomial-time and polynomial-time algorithms to solve the integer linear optimization problem defined on simplices minus all their integer vertices assuming that some minors of the constraint matrices of the simplices are bounded.
Cite
@article{arxiv.1710.00328,
title = {The Width and Integer Optimization on Simplices With Bounded Minors of the Constraint Matrices},
author = {D. V. Gribanov and A. Y. Chirkov},
journal= {arXiv preprint arXiv:1710.00328},
year = {2022}
}
Comments
12 pages