DeepAI

# A note on the parametric integer programming in the average case: sparsity, proximity, and FPT-algorithms

We consider the Integer Linear Programming (ILP) problem max{c^ x : A x ≤ b, x ∈ Z^n }, parameterized by a right-hand side vector b ∈ Z^m, where A ∈ Z^m × n is a matrix of the rank n. Let v be an optimal vertex of the Linear Programming (LP) relaxation max{c^ x : A x ≤ b} and B be a corresponding optimal base. We show that, for almost all b ∈ Z^m, an optimal point of the square ILP problem max{c^ x : A_B x ≤ b_B, x ∈ Z^n } satisfies the constraints A x ≤ b of the original problem. From works of R. Gomory it directly follows that the square ILP problem max{c^ x : A_B x ≤ b_B, x ∈ Z^n } can be solved by an algorithm of the arithmetic complexity O(n ·δ·logδ), where δ = | A_B|. Consequently, it can be shown that, for almost all b ∈ Z^m, the original problem max{c^ x : A x ≤ b, x ∈ Z^n } can be solved by an algorithm of the arithmetic complexity O(n ·Δ·logΔ), where Δ is the maximum absolute value of n × n minors of A. By the same technique, we give new inequalities on the integrality gap and sparsity of a solution and slack variables. Another ingredient is a known lemma that states the equality of the maximum absolute values of rank minors of matrices with orthogonal columns. This lemma gives us a way to transform ILP problems of the type max{c^ x : A x = b, x ∈ Z^n_+} to problems of the previous type, here we assume that rank(A) = m and all the m × m minors of A are coprime. Consequently, it follows that, for almost all b ∈ Z^m, there exists an algorithm with the arithmetic complexity O((n-m) ·Δ·logΔ) to solve the problem in the equality form. Sparsity and integrality gap bounds are also presented.

• 12 publications
• 6 publications
• 3 publications
02/03/2020

### Properties of Δ-modular simplicies and "close" polyhedrons. O(Δ· polylog(Δ))-algorithm for knapsack, proximity and sparsity

In this work we consider properties of square and "close"-square Δ-modul...
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...
10/01/2017

### FPT-algorithms for The Shortest Lattice Vector and Integer Linear Programming Problems

In this paper, we present FPT-algorithms for special cases of the shorte...
09/10/2020

### Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers

In breakthrough work, Tardos (Oper. Res. '86) gave a proximity based fra...
05/02/2022

### A Two Parameters Equation for Word Rank-Frequency Relation

Let f (·) be the absolute frequency of words and r be the rank of words ...
07/07/2023

### Absolute value linear programming

We deal with linear programming problems involving absolute values in th...
03/19/2021

### Empirical Optimization on Post-Disaster Communication Restoration for Social Equality

Disasters are constant threats to humankind, and beyond losses in lives,...