On the size of integer programs with bounded non-vanishing subdeterminants

DOI10.1016/J.JCTA.2024.106003MaRDI QIDQ7026952zbMATH OpenFDO

Authors Björn Kriepke, Gohar M. Kyureghyan, Matthias Henze

Publication date 17 February 2025

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTA.2024.106003

zbMATH Keywords

column number questionfinite fieldsgeometry of numbersinteger programmingminors

Mathematics Subject Classification ID

Integer programming (90C10)

Cites work

• hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
• A new algorithm for the maximum-weight clique problem
• A note on non-degenerate integer programs with small sub-determinants
• A review on algorithms for maximum clique problems
• A strongly polynomial algorithm for bimodular integer linear programming
• Advances on strictly \(\varDelta \)-modular IPs
• Algorithms for maximum independent sets
• Alternative formulae for the number of sublattices
• An algorithm for canonical forms of finite subsets of \(\mathbb {Z}^d\) up to affinities
• Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice
• Classification algorithms for codes and designs
• Congruency-constrained TU problems beyond the bimodular case
• Convex and Discrete Geometry
• Enumerating integer points in polytopes with bounded subdeterminants
• Excluding a line from complex-representable matroids
• Finding a Maximum Independent Set
• Finite geometry and combinatorial applications
• FPT-algorithms for some problems related to integer programming
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3649580 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 958053 (Why is no real title available?)
• Integer program with bimodular matrix
• Integer programs with bounded subdeterminants and two nonzeros per row
• Isosystolic inequalities for optical hypersurfaces
• Notes on \(\{a,b,c\}\)-modular matrices
• On densities of lattice arrangements intersecting every \(i\)-dimensional affine subspace
• On largest volume simplices and sub-determinants
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• On the Column Number and Forbidden Submatrices for -Modular Matrices
• On the maximal number of columns of a -modular integer matrix: bounds and computations
• On the maximal number of columns of a \(\varDelta \)-modular matrix
• Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs
• Reducibility among combinatorial problems
• Research Problems in Discrete Geometry
• The difference between consecutive primes. II
• The integrality number of an integer program
• The subspace flatness conjecture and faster integer programming

Cited in

(2)

• Unimodular polytopes and column number bounds on polytopal totally unimodular matrices via Seymour's decomposition theorem
• On generic -modular integer matrices with two rows

This page was built for publication: On the size of integer programs with bounded non-vanishing subdeterminants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7026952)