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