The following pages link to (Q4904855):
Displaying 50 items.
- Lower bounds on the graver complexity of \(M\)-fold matrices (Q259721) (← links)
- A polyhedral model of partitions with bounded differences and a bijective proof of a theorem of Andrews, Beck, and Robbins (Q292439) (← links)
- Quadratic diameter bounds for dual network flow polyhedra (Q312672) (← links)
- An algebraic-perturbation variant of Barvinok's algorithm (Q324705) (← links)
- Parity binomial edge ideals (Q737975) (← links)
- The fiber dimension of a graph (Q1618232) (← links)
- Bouquet algebra of toric ideals (Q1655816) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- Computing with an algebraic-perturbation variant of Barvinok's algorithm (Q1707914) (← links)
- The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
- Efficient solutions for weight-balanced partitioning problems (Q1751164) (← links)
- Construction of all polynomial relations among Dedekind eta functions of level \(N\) (Q2000261) (← links)
- Composable computation in discrete chemical reaction networks (Q2064055) (← links)
- A polyhedral model for enumeration and optimization over the set of circuits (Q2064285) (← links)
- Empowering the configuration-IP: new PTAS results for scheduling with setup times (Q2089776) (← links)
- Sublinear circuits for polyhedral sets (Q2135087) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Factorization length distribution for affine semigroups. II: Asymptotic behavior for numerical semigroups with arbitrarily many generators (Q2221832) (← links)
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
- Toric fiber products versus Segre products (Q2255354) (← links)
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets (Q2282534) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- Reciprocal class of jump processes (Q2360640) (← links)
- Polyhedral omega: a new algorithm for solving linear Diophantine systems (Q2363492) (← links)
- Heat-bath random walks with Markov bases (Q2407392) (← links)
- Ameso optimization: a relaxation of discrete midpoint convexity (Q2659175) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- ALGEBRAIC AND GEOMETRIC PROPERTIES OF LATTICE WALKS WITH STEPS OF EQUAL LENGTH (Q2986611) (← links)
- Existence of unimodular triangulations — positive results (Q3380553) (← links)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- Geometry of the Minimal Solutions of a Linear Diophantine Equation (Q4959654) (← links)
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
- On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
- About the Complexity of Two-Stage Stochastic IPs (Q5041750) (← links)
- Enumerating Integer Points in Polytopes with Bounded Subdeterminants (Q5062109) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- FACTORIZATION LENGTH DISTRIBUTION FOR AFFINE SEMIGROUPS III: MODULAR EQUIDISTRIBUTION FOR NUMERICAL SEMIGROUPS WITH ARBITRARILY MANY GENERATORS (Q5089891) (← links)
- (Q5090494) (← links)
- Discrete Midpoint Convexity (Q5108259) (← links)
- (Q5111743) (← links)
- Monomial Tropical Cones for Multicriteria Optimization (Q5112824) (← links)
- (Q5140719) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
- Petri Net Reductions for Counting Markings (Q5883572) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
- High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)
