Pages that link to "Item:Q993280"
From MaRDI portal
The following pages link to Nonlinear discrete optimization. An algorithmic theory (Q993280):
Displaying 50 items.
- Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory (Q314827) (← links)
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- On nonlinear multi-covering problems (Q511715) (← links)
- Intractability of approximate multi-dimensional nonlinear optimization on independence systems (Q533792) (← links)
- Primitive zonotopes (Q724942) (← links)
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations (Q1650771) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- Shifted matroid optimization (Q1694792) (← links)
- The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
- Efficient solutions for weight-balanced partitioning problems (Q1751164) (← links)
- Robust integer programming (Q1785307) (← links)
- The unimodular intersection problem (Q1785442) (← links)
- The quadratic Graver cone, quadratic integer minimization, and extensions (Q1925790) (← links)
- Graver basis for an undirected graph and its application to testing the beta model of random graphs (Q1934480) (← links)
- \(n\)-fold integer programming in cubic time (Q1942262) (← links)
- A note on the approximability of deepest-descent circuit steps (Q2060534) (← links)
- A polyhedral model for enumeration and optimization over the set of circuits (Q2064285) (← links)
- Improved analysis of online balanced clustering (Q2085752) (← links)
- Empowering the configuration-IP: new PTAS results for scheduling with setup times (Q2089776) (← links)
- The complexity of vector partition (Q2155634) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
- Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\) (Q2301979) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- Huge multiway table problems (Q2339833) (← links)
- Convex integer optimization by constantly many linear counterparts (Q2451653) (← links)
- Ameso optimization: a relaxation of discrete midpoint convexity (Q2659175) (← links)
- On degree sequence optimization (Q2661577) (← links)
- Optimization over degree sequences of graphs (Q2663988) (← links)
- Circuit walks in integral polyhedra (Q2673232) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Approximate separable multichoice optimization over monotone systems (Q2673246) (← links)
- Huge Unimodular $n$-Fold Programs (Q3455242) (← links)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
- The vertices of primitive zonotopes (Q4998741) (← links)
- Faster Algorithms for Integer Programs with Block Structure (Q5002724) (← links)
- (Q5002753) (← links)
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
- On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) (Q5009328) (← links)
- Enumerating Integer Points in Polytopes with Bounded Subdeterminants (Q5062109) (← links)
- (Q5090421) (← links)
- Discrete Midpoint Convexity (Q5108259) (← links)
- (Q5111743) (← links)
- (Q5140719) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- The slope conjecture for Montesinos knots (Q5853659) (← links)
- Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (Q5858649) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
- (Q5874501) (← links)
