Nonlinear discrete optimization. An algorithmic theory
From MaRDI portal
Publication:993280
DOI10.4171/093zbMATH Open1219.90003OpenAlexW1513894211MaRDI QIDQ993280FDOQ993280
Authors: Shmuel Onn 
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
Recommendations
Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (66)
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- Intractability of approximate multi-dimensional nonlinear optimization on independence systems
- Title not available (Why is that?)
- Improved analysis of online balanced clustering
- Graver basis for an undirected graph and its application to testing the beta model of random graphs
- On degree sequence optimization
- Optimality criterion for a class of nonlinear integer programs.
- Scheduling meets \(n\)-fold integer programming
- Monomial Tropical Cones for Multicriteria Optimization
- The complexity landscape of decompositional parameters for ILP
- Efficient solutions for weight-balanced partitioning problems
- Primitive zonotopes
- Discrete midpoint convexity
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- Algebraic and geometric ideas in the theory of discrete optimization
- Optimization over degree sequences of graphs
- Title not available (Why is that?)
- Ameso optimization: a relaxation of discrete midpoint convexity
- Robust integer programming
- Solving MIPs via scaling-based augmentation
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
- Foundations of discrete optimization: in transition from linear to non-linear models and methods
- Title not available (Why is that?)
- On the number of circuits in regular matroids (with connections to lattices and codes)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Enumerating integer points in polytopes with bounded subdeterminants
- Approximate separable multichoice optimization over monotone systems
- Integer programming in parameterized complexity: five miniatures
- Nonlinear Matroid Optimization and Experimental Design
- A note on the approximability of deepest-descent circuit steps
- Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory
- The quadratic Graver cone, quadratic integer minimization, and extensions
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- Convex integer optimization by constantly many linear counterparts
- The complexity of vector partition
- A polyhedral model for enumeration and optimization over the set of circuits
- Evaluating and tuning \(n\)-fold integer programming
- Title not available (Why is that?)
- A framework of discrete DC programming by discrete convex analysis
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- Complexity of optimizing over the integers
- Huge unimodular \(n\)-fold programs
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
- \(n\)-fold integer programming in cubic time
- Shifted matroid optimization
- The unimodular intersection problem
- Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\)
- The slope conjecture for Montesinos knots
- Title not available (Why is that?)
- Faster Algorithms for Integer Programs with Block Structure
- On nonlinear multi-covering problems
- Circuit walks in integral polyhedra
- The vertices of primitive zonotopes
- Empowering the configuration-IP: new PTAS results for scheduling with setup times
- Title not available (Why is that?)
- Convex discrete optimization
- Combinatorial \(n\)-fold integer programming and applications
- Combinatorial \(n\)-fold integer programming and applications
- Huge multiway table problems
- High-multiplicity \(N\)-fold IP via configuration LP
- Pivot rules for circuit-augmentation algorithms in linear optimization
- Asymptotic behavior of Markov complexity
- FPT algorithms for a special block-structured integer program with applications in scheduling
- Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube
- Circuit and Graver walks and linear and integer programming
This page was built for publication: Nonlinear discrete optimization. An algorithmic theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993280)
