The Width and Integer Optimization on Simplices With Bounded Minors of the Constraint Matrices

10/01/2017
by   D. V. Gribanov, et al.
0

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 FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2021

Integer programs with bounded subdeterminants and two nonzeros per row

We give a strongly polynomial-time algorithm for integer linear programs...
research
02/10/2022

On the Identity Problem for Unitriangular Matrices of Dimension Four

We show that the Identity Problem is decidable in polynomial time for fi...
research
06/28/2021

Notes on {a,b,c}-Modular Matrices

Let A ∈ℤ^m × n be an integral matrix and a, b, c ∈ℤ satisfy a ≥ b ≥ c ≥ ...
research
09/07/2021

Congruency-Constrained TU Problems Beyond the Bimodular Case

A long-standing open question in Integer Programming is whether integer ...
research
12/18/2017

FPT-algorithms for some problems related to integer programming

In this paper, we present FPT-algorithms for special cases of the shorte...
research
06/15/2018

Polyhedra Circuits and Their Applications

We introduce polyhedra circuits. Each polyhedra circuit characterizes a ...
research
02/08/2023

Optimal Sufficient Requirements on the Embedded Ising Problem in Polynomial Time

One of the central applications for quantum annealers is to find the sol...

Please sign up or login with your details

Forgot password? Click here to reset