Advances on strictly \(\varDelta \)-modular IPs
From MaRDI portal
Publication:6086017
DOI10.1007/978-3-031-32726-1_28zbMath1528.90156OpenAlexW4377199998MaRDI QIDQ6086017
Richard Santiago, Rico Zenklusen, Christian Nöbel, Martin Nägele
Publication date: 9 November 2023
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-32726-1_28
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Unnamed Item
- On integer programming with bounded determinants
- Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
- On linear systems with integral valued solutions
- Integer program with bimodular matrix
- A construction for binary matroids
- Decomposition of regular matroids
- Geometric algorithms and combinatorial optimization.
- A note on non-degenerate integer programs with small sub-determinants
- Minimizing submodular functions over families of sets
- On the recognition of \(\{a,b,c\}\)-modular matrices
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem
- On the maximal number of columns of a \(\varDelta \)-modular matrix
- Improving proximity bounds using sparsity
- Submodular minimization under congruency constraints
- Geometric random edge
- Randomized Rounding for the Largest Simplex Problem
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants
- Odd Minimum Cut-Sets and b-Matchings
- Random pseudo-polynomial algorithms for exact matroid problems
- A strongly polynomial algorithm for bimodular integer linear programming
- The Integrality Number of an Integer Program
- Regular Matroids Have Polynomial Extension Complexity
- Matroid Secretary for Regular and Decomposable Matroids
- On largest volume simplices and sub-determinants
- On sub-determinants and the diameter of polyhedra
- A new contraction technique with applications to congruency-constrained cuts
- Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems
