Nonlinear discrete optimization. An algorithmic theory

DOI10.4171/093zbMath1219.90003OpenAlexW1513894211MaRDI QIDQ993280

Publication date: 10 September 2010

Published in: Zurich Lectures in Advanced Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/093

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Huge Unimodular $n$-Fold Programs, Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory, On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond, Enumerating Integer Points in Polytopes with Bounded Subdeterminants, Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations, The complexity of vector partition, Solving MIPs via scaling-based augmentation, Ameso optimization: a relaxation of discrete midpoint convexity, On degree sequence optimization, A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs, Optimization over degree sequences of graphs, The quadratic Graver cone, quadratic integer minimization, and extensions, Circuit walks in integral polyhedra, Integer programming in parameterized complexity: five miniatures, Approximate separable multichoice optimization over monotone systems, High-multiplicity $N$-fold IP via configuration LP, Graver basis for an undirected graph and its application to testing the beta model of random graphs, Discrete Midpoint Convexity, Shifted matroid optimization, Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube, $n$-fold integer programming in cubic time, Complexity of optimizing over the integers, Unnamed Item, Unnamed Item, Asymptotic behavior of Markov complexity, Combinatorial $n$-fold integer programming and applications, Convex integer optimization by constantly many linear counterparts, Faster Algorithms for Integer Programs with Block Structure, A framework of discrete DC programming by discrete convex analysis, The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints, On nonlinear multi-covering problems, The complexity landscape of decompositional parameters for ILP, Efficient solutions for weight-balanced partitioning problems, Graver basis and proximity techniques for block-structured separable convex integer minimization problems, Intractability of approximate multi-dimensional nonlinear optimization on independence systems, Parameterized shifted combinatorial optimization, Unnamed Item, Robust integer programming, The unimodular intersection problem, Primitive zonotopes, Unnamed Item, Unboundedness of Markov complexity of monomial curves in $\mathbb{A}^n$ for $n \geq 4$, A note on the approximability of deepest-descent circuit steps, A polyhedral model for enumeration and optimization over the set of circuits, Scheduling meets $n$-fold integer programming, Unnamed Item, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, The vertices of primitive zonotopes, Improved analysis of online balanced clustering, Empowering the configuration-IP: new PTAS results for scheduling with setup times, The slope conjecture for Montesinos knots, On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes), Huge multiway table problems, Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces, Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization