Integer program with bimodular matrix
S. I. Veselov,A. J. Chirkov +1 more
60
TL;DR: A polynomial time algorithm that finds an integer solution for system max{cx:[email protected]?b} is given, proceeding on some assumptions.
read more
About: This article is published in Discrete Optimization. The article was published on 01 May 2009. and is currently open access. The article focuses on the topics: Unimodular matrix & Integer square root.
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
A note on non-degenerate integer programs with small sub-determinants
Stephan Artmann,Friedrich Eisenbrand,Christoph Glanzer,Timm Oertel,Santosh Vempala,Robert Weismantel +5 more
TL;DR: The intention of this note is to find an algorithm to solve integer optimization problems in standard form defined by AZmn in polynomial-time provided that both the largest absolute value of an entry in A and m are constant.
36
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
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
TL;DR: In this article, it was shown that tree-fold integer programs can be solved in strongly polynomial time using O(f(A)n^3) arithmetic operations.
22
The width and integer optimization on simplices with bounded minors of the constraint matrices
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.
17
•Posted Content
A Note on Non-Degenerate Integer Programs with Small Sub-Determinants
Stephan Artmann,Friedrich Eisenbrand,Christoph Glanzer,Timm Oertel,Santosh Vempala,Robert Weismantel +5 more
TL;DR: In this article, the authors studied integer programs in inequality form in polynomial-time, where the absolute values of all maximal sub-determinants of a program lie between a constant and a constant.
16