Pages that link to "Item:Q4978060"

The following pages link to A strongly polynomial algorithm for bimodular integer linear programming (Q4978060):

Displaying 36 items.

• On integer programming with bounded determinants (Q315478) (← links)
• Integer program with bimodular matrix (Q1015329) (← links)
• The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648) (← links)
• FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
• A note on non-degenerate integer programs with small sub-determinants (Q1755835) (← links)
• On the recognition of \(\{a,b,c\}\)-modular matrices (Q2061884) (← links)
• An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
• The integrality number of an integer program (Q2118127) (← links)
• Extended formulations for stable set polytopes of graphs without two disjoint odd cycles (Q2118145) (← links)
• Notes on \(\{a,b,c\}\)-modular matrices (Q2135088) (← links)
• On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
• On the maximal number of columns of a \(\varDelta \)-modular matrix (Q2164672) (← links)
• FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← links)
• Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
• Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
• On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants (Q3174729) (← links)
• Faster Algorithms for Integer Programs with Block Structure (Q5002724) (← links)
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
• Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles (Q5041738) (← links)
• The Integrality Number of an Integer Program (Q5041756) (← links)
• Enumerating Integer Points in Polytopes with Bounded Subdeterminants (Q5062109) (← links)
• On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases (Q5099099) (← links)
• A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices (Q5163506) (← links)
• Subdeterminants and Concave Integer Quadratic Programming (Q5206942) (← links)
• 2-Modular Matrices (Q5864215) (← links)
• Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
• (Q5874501) (← links)
• A new contraction technique with applications to congruency-constrained cuts (Q5918921) (← links)
• New Bounds for the Integer Carathéodory Rank (Q6136661) (← links)
• On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices (Q6146267) (← links)
• Complexity of optimizing over the integers (Q6160281) (← links)
• Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming (Q6173941) (← links)
• On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
• Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (Q6500104) (← links)
• On the maximal number of columns of a \(\Delta \)-modular integer matrix: bounds and computations (Q6589744) (← links)
• Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)