A strongly polynomial algorithm for bimodular integer linear programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1161055
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A Strongly Polynomial Algorithm for a Special Class of Linear Programs
- A strongly polynomial-time algorithm for a class of integer programming problems
- scientific article; zbMATH DE number 5925034
- A strongly polynomial method for solving integer max-linear optimization problems in a generic case
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- A strongly polynomial algorithm for linear systems having a binary solution
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- An integer linear programming approach for bilinear integer programming
Cited in
(56)- Integer program with bimodular matrix
- The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
- FPT-algorithms for some problems related to integer programming
- A note on non-degenerate integer programs with small sub-determinants
- On the recognition of \(\{a,b,c\}\)-modular matrices
- An FPTAS for the -modular multidimensional knapsack problem
- The integrality number of an integer program
- Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
- Notes on \(\{a,b,c\}\)-modular matrices
- On lattice point counting in -modular polyhedra
- On the maximal number of columns of a \(\varDelta \)-modular matrix
- FPT-algorithm for computing the width of a simplex given by a convex hull
- Integer programming in parameterized complexity: five miniatures
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- On integer programming with bounded determinants
- On the number of distinct rows of a matrix with bounded subdeterminants
- A unimodular problem of integer programming
- A strongly polynomial-time algorithm for a class of integer programming problems
- Faster Algorithms for Integer Programs with Block Structure
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
- The Integrality Number of an Integer Program
- Enumerating integer points in polytopes with bounded subdeterminants
- On lattice width of lattice-free polyhedra and height of Hilbert bases
- A polynomial time algorithm for solving the closest vector problem in zonotopal lattices
- Subdeterminants and concave integer quadratic programming
- On Integer Programming and the Branch-Width of the Constraint Matrix
- 2-modular matrices
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
- scientific article; zbMATH DE number 7651172 (Why is no real title available?)
- A new contraction technique with applications to congruency-constrained cuts
- Advances on strictly \(\varDelta \)-modular IPs
- Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs
- New Bounds for the Integer Carathéodory Rank
- On the Column Number and Forbidden Submatrices for -Modular Matrices
- Complexity of optimizing over the integers
- Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming
- On -modular integer linear problems in the canonical form and equivalent problems
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
- On the maximal number of columns of a -modular integer matrix: bounds and computations
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- Congruency-constrained TU problems beyond the bimodular case
- Integer programs with bounded subdeterminants and two nonzeros per row
- Problems on group-labeled matroid bases
- Totally -modular IPs with two non-zeros in most rows
- On the diameter of a 2-sum of polyhedra
- On the exact matching problem in dense graphs
- Exact matching: correct parity and FPT parameterized by independence number
- A mathematical programming approach for recognizing binet matrices
- Extended formulations for the integer hull of strictly -modular cographic polyhedral cones
- Advances on strictly -modular IPs
- On the size of integer programs with bounded non-vanishing subdeterminants
- On the congruency-constrained matroid base
- On matrices over a polynomial ring with restricted subdeterminants
- Total matching and subdeterminants
- On generic -modular integer matrices with two rows
This page was built for publication: A strongly polynomial algorithm for bimodular integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978060)
