A strongly polynomial algorithm for bimodular integer linear programming

Similar Works

Action	Title	Year	Authors
+	Integer program with bimodular matrix	2009	С. И. Веселов A. Ju. Chirkov
+	Congruency-Constrained TU Problems Beyond the Bimodular Case	2021	Martin Nägele Richard Santiago Rico Zenklusen
+ PDF Chat	Congruency-Constrained TU Problems Beyond the Bimodular Case	2024	Martin Nägele Richard Santiago Rico Zenklusen
+	Polynomial upper bounds on the number of differing columns of $Δ$-modular integer programs	2021	Jon Lee Joseph Paat Ingo Stallknecht Luze Xu
+ PDF Chat	Congruency-Constrained TU Problems Beyond the Bimodular Case	2022	Martin Nägele Richard Santiago Rico Zenklusen
+	On $Δ$-Modular Integer Linear Problems In The Canonical Form And Equivalent Problems	2020	D. V. Gribanov Ivan Shumilov D. S. Malyshev P. M. Pardalos
+	Polynomial upper bounds on the number of differing columns of an integer program	2021	Jon Lee Joseph Paat Ingo Stallknecht Luze Xu
+ PDF Chat	Tight Lower Bounds for Block-Structured Integer Programs	2024	Christoph Hunkenschröder Kim-Manuel Klein Martin Koutecký Alexandra Lassota Asaf Levin
+ PDF Chat	On integer programming with bounded determinants	2015	D. V. Gribanov С. И. Веселов
+	Block-structured Integer Programming: Can we Parameterize without the Largest Coefficient?	2020	Lin Chen Hua Chen Guochuan Zhang
+	A unimodular problem of integer programming	1986	Oleg Shcherbina
+ PDF Chat	Integer programs with bounded subdeterminants and two nonzeros per row	2022	Samuel Fiorini Gwenaël Joret Stefan Weltge Yelena Yuditsky
+	Tight complexity lower bounds for integer linear programming with few constraints	2018	Dušan Knop Michał Pilipczuk Marcin Wrochna
+ PDF Chat	On the optimality of pseudo-polynomial algorithms for integer programming	2022	Fedor V. Fomin Fahad Panolan M. S. Ramanujan Saket Saurabh
+	Tight complexity lower bounds for integer linear programming with few constraints	2018	Dušan Knop Michał Pilipczuk Marcin Wrochna
+	A Note on Non-Degenerate Integer Programs with Small Sub-Determinants	2016	Stephan Artmann Friedrich Eisenbrand Christoph Glanzer Timm Oertel Santosh Vempala Robert Weismantel
+	A Note on Non-Degenerate Integer Programs with Small Sub-Determinants	2016	Stephan Artmann Friedrich Eisenbrand Christoph Glanzer Timm Oertel Santosh Vempala Robert Weismantel
+	On the Graver basis of block-structured integer programming	2018	Lin Chen Lei Xu Weidong Shi
+	On the Optimality of Pseudo-polynomial Algorithms for Integer Programming	2016	Fedor V. Fomin Fahad Panolan M. S. Ramanujan Saket Saurabh
+ PDF Chat	Integer programs with nearly totally unimodular matrices: the cographic case	2024	Manuel Aprile Samuel Fiorini Gwenaël Joret Stefan Kober Michał T. Seweryn Stefan Weltge Yelena Yuditsky

Works That Cite This (41)

Action	Title	Year	Authors
+	On the maximal number of columns of a $\Delta$-modular matrix	2021	Gennadiy Averkov Matthias Schymura
+	On lattice point counting in Δ-modular polyhedra.	2020	D. V. Gribanov Nikolai Yu. Zolotykh
+	Polynomial upper bounds on the number of differing columns of $Δ$-modular integer programs	2021	Jon Lee Joseph Paat Ingo Stallknecht Luze Xu
+	A polynomial time algorithm for solving the closest vector problem in zonotopal lattices	2020	S. Thomas McCormick Britta Peis Robert Scheidweiler Frank Vallentin
+ PDF Chat	On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases	2022	Martin Henk Stefan Kuhlmann Robert Weismantel
+ PDF Chat	On Matrices over a Polynomial Ring with Restricted Subdeterminants	2024	Marcel Celaya Stefan Kuhlmann Robert Weismantel
+ PDF Chat	On lattice point counting in $$\varDelta $$-modular polyhedra	2021	D. V. Gribanov Nikolai Yu. Zolotykh
+	An Algorithmic Theory of Integer Programming	2019	Friedrich Eisenbrand Christoph Hunkenschröder Kim-Manuel Klein Martin Koutecký Asaf Levin Shmuel Onn
+	Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises.	2021	Cornelius Brand Martin Koutecký Alexandra Lassota Sebastian Ordyniak
+	A mathematical programming approach for recognizing binet matrices	2023	Konstantinos Papalamprou Leonidas Pitsoulis Balász Kotnyek

Works Cited by This (11)

Action	Title	Year	Authors
+	Solving the stable set problem in terms of the odd cycle packing number	2014	Adrian Bock Yuri Faenza Carsten Moldenhauer Andres J. Ruiz-Vargas
+	Geometric random edge	2016	Friedrich Eisenbrand Santosh Vempala
+	Random walks, totally unimodular matrices, and a randomised dual simplex algorithm	1994	Martin Dyer Alan Frieze
+ PDF Chat	On Sub-determinants and the Diameter of Polyhedra	2014	Nicolas Bonifas Marco Di Summa Friedrich Eisenbrand Nicolai Hähnle Martin Niemeier
+ PDF Chat	Optimization with binet matrices	2006	Gautam Appa Balázs Kotnyek Konstantinos Papalamprou Leonidas Pitsoulis
+	Short Cocircuits in Binary Matroids	1987	Robert E. Bixby William H. Cunningham
+	On the minors of an incidence matrix and its Smith normal form	1995	Jerrold W. Grossman Amey Kulkarni Irwin E. Schochetman
+	Rational and integral k-regular matrices	2003	Gautam Appa Balázs Kotnyek
+	Integer program with bimodular matrix	2009	С. И. Веселов A. Ju. Chirkov
+ PDF Chat	A note on non-degenerate integer programs with small sub-determinants	2016	Stephan Artmann Friedrich Eisenbrand Christoph Glanzer Timm Oertel Santosh Vempala Robert Weismantel