Nonlinear discrete optimization. An algorithmic theory
From MaRDI portal
(Redirected from Publication:993280)
Recommendations
Cited in
(66)- Combinatorial \(n\)-fold integer programming and applications
- Huge multiway table problems
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- Intractability of approximate multi-dimensional nonlinear optimization on independence systems
- scientific article; zbMATH DE number 6152371 (Why is no real title available?)
- Improved analysis of online balanced clustering
- Graver basis for an undirected graph and its application to testing the beta model of random graphs
- Optimality criterion for a class of nonlinear integer programs.
- On degree sequence optimization
- Scheduling meets n-fold integer programming
- The complexity landscape of decompositional parameters for ILP
- Monomial Tropical Cones for Multicriteria Optimization
- High-multiplicity \(N\)-fold IP via configuration LP
- 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
- Ameso optimization: a relaxation of discrete midpoint convexity
- Robust integer programming
- scientific article; zbMATH DE number 582915 (Why is no real title available?)
- Solving MIPs via scaling-based augmentation
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
- 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
- Foundations of discrete optimization: in transition from linear to non-linear models and methods
- scientific article; zbMATH DE number 872648 (Why is no real title available?)
- 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
- Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory
- Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube
- Approximate separable multichoice optimization over monotone systems
- Integer programming in parameterized complexity: five miniatures
- A note on the approximability of deepest-descent circuit steps
- Enumerating integer points in polytopes with bounded subdeterminants
- Nonlinear Matroid Optimization and Experimental Design
- The quadratic Graver cone, quadratic integer minimization, and extensions
- Convex integer optimization by constantly many linear counterparts
- The complexity of vector partition
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- A framework of discrete DC programming by discrete convex analysis
- A polyhedral model for enumeration and optimization over the set of circuits
- Evaluating and tuning \(n\)-fold integer programming
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
- scientific article; zbMATH DE number 7651172 (Why is no real title available?)
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- Huge unimodular \(n\)-fold programs
- Complexity of optimizing over the integers
- \(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\)
- On nonlinear multi-covering problems
- Circuit and Graver walks and linear and integer programming
- The slope conjecture for Montesinos knots
- scientific article; zbMATH DE number 1383149 (Why is no real title available?)
- Faster Algorithms for Integer Programs with Block Structure
- Circuit walks in integral polyhedra
- Empowering the configuration-IP: new PTAS results for scheduling with setup times
- The vertices of primitive zonotopes
- scientific article; zbMATH DE number 7559087 (Why is no real title available?)
- Convex discrete optimization
- Combinatorial \(n\)-fold integer programming and applications
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)
