Pages that link to "Item:Q1015329"
From MaRDI portal
The following pages link to Integer program with bimodular matrix (Q1015329):
Displaying 30 items.
- On integer programming with bounded determinants (Q315478) (← 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)
- 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)
- Improving the Cook et al. proximity bound given integral valued constraints (Q2164682) (← links)
- Distances between optimal solutions of mixed-integer programs (Q2288201) (← links)
- FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← links)
- The computational complexity of three graph problems for instances with bounded minors of constraint matrices (Q2357129) (← 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)
- 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)
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem (Q5131709) (← links)
- On Proximity for k-Regular Mixed-Integer Linear Optimization (Q5214422) (← links)
- The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point (Q5265218) (← links)
- 2-Modular Matrices (Q5864215) (← links)
- (Q5884490) (← 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)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)