The width and integer optimization on simplices with bounded minors of the constraint matrices
17
TL;DR: It is shown 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.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The integrality number of an integer program
TL;DR: From the results it follows that IPs defined by only n constraints can be solved via a MIP relaxation with $$O(\sqrt{\varDelta })$$ O ( Δ ) many integer constraints.
29
The distributions of functions related to parametric integer optimization
TL;DR: It is shown that the typical values of these functions are smaller than the known worst case bounds by providing a spectrum of probability-like results that govern their overall asymptotic distributions.
FPT-algorithms for some problems related to integer programming
D. V. Gribanov,D. V. Gribanov,Dmitriy S. Malyshev,Panos M. Pardalos,Panos M. Pardalos,S. I. Veselov +5 more
TL;DR: In this paper, the authors present FPT-algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems' formulations are near square.
•Posted Content
On $\Delta$-Modular Integer Linear Problems In The Canonical Form And Equivalent Problems
TL;DR: In this paper, the authors considered the problem of integer linear programming in the canonical form and gave sparsity, proximity, and complexity results for polynomially reducing a standard form ILP problem to a canonical ILP in the standard form.
13
•Posted Content
The Integrality Number of an Integer Program
TL;DR: From the results it follows that IPs defined by only $n$ constraints can be solved via a MIP relaxation with $O(\sqrt{\Delta})$ many integer constraints.
9
References
•Book
Theory of Linear and Integer Programming
Alexander Schrijver
- 01 Dec 1986
TL;DR: Introduction and Preliminaries.
Handbook of global optimization
Reiner Horst,Panos M. Pardalos,H. Edwin Romeijn +2 more
- 01 Jan 1995
TL;DR: This paper presents algorithms for global optimization of mixed-integer nonlinear programs using the Reformulation-Linearization/Convexification Technique (RLT) and an introduction to dynamical search.
•Book
Integer Programming and Network Flows
S. Vajda
- 16 Feb 1970
TL;DR: Interestingly, integer programming and network flows that you really wait for now is coming, it's significant to wait for the representative and beneficial books to read.
739
On the complexity of integer programming
TL;DR: A simple proof that integer programming ts in X means that there is a pseudopolynomial-tune algorithm for integer programmmg with any (fixed) number of constraints is given.