Algebraic and geometric ideas in the theory of discrete optimization
From MaRDI portal
Publication:4904855
zbMATH Open1401.90012MaRDI QIDQ4904855FDOQ4904855
Authors: Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe 
Publication date: 12 February 2013
Recommendations
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Computational aspects in algebraic geometry (14Q99)
Cited In (66)
- Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates
- On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices
- Equivariant lattice bases
- High-multiplicity \(N\)-fold IP via configuration LP
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- \textsc{Sagbi} combinatorics of maximal minors and a \textsc{Sagbi} algorithm
- Pivot rules for circuit-augmentation algorithms in linear optimization
- Real Algebraic Geometry and Optimization
- Convexity and its applications in discrete and continuous optimization (to appear)
- Geometric decision procedures and the VC dimension of linear arithmetic theories
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- Enumeration and unimodular equivalence of empty delta-modular simplices
- Title not available (Why is that?)
- Petri Net Reductions for Counting Markings
- Lower bounds on the graver complexity of \(M\)-fold matrices
- Factorization length distribution for affine semigroups. II: Asymptotic behavior for numerical semigroups with arbitrarily many generators
- From combinatorial optimization to real algebraic geometry and back
- Construction of all polynomial relations among Dedekind eta functions of level \(N\)
- The fiber dimension of a graph
- A guide to conic optimisation and its applications
- Sublinear circuits for polyhedral sets
- Scheduling meets \(n\)-fold integer programming
- Monomial Tropical Cones for Multicriteria Optimization
- Algebra and discrete mathematics 2. Linear optimization, graphs and algorithms, algebraic structures and general algebra with applications
- The complexity landscape of decompositional parameters for ILP
- A polyhedral model of partitions with bounded differences and a bijective proof of a theorem of Andrews, Beck, and Robbins
- Efficient solutions for weight-balanced partitioning problems
- Discrete midpoint convexity
- Composable computation in discrete chemical reaction networks
- Geometry of the Minimal Solutions of a Linear Diophantine Equation
- Normal Forms and Unfoldings for Local Dynamical Systems
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- Factorization length distribution for affine semigroups. III: Modular equidistribution for numerical semigroups with arbitrarily many generators
- Parity binomial edge ideals
- Quadratic diameter bounds for dual network flow polyhedra
- Bouquet algebra of toric ideals
- Data loci in algebraic optimization
- On the length of monotone paths in polyhedra
- Ameso optimization: a relaxation of discrete midpoint convexity
- An algebraic-perturbation variant of Barvinok's algorithm
- Solving MIPs via scaling-based augmentation
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
- On lattice point counting in \(\varDelta\)-modular polyhedra
- Toric fiber products versus Segre products
- Nonlinear discrete optimization. An algorithmic theory
- Foundations of discrete optimization: in transition from linear to non-linear models and methods
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Enumerating integer points in polytopes with bounded subdeterminants
- Integer programming in parameterized complexity: five miniatures
- ALGEBRAIC AND GEOMETRIC PROPERTIES OF LATTICE WALKS WITH STEPS OF EQUAL LENGTH
- Title not available (Why is that?)
- Short Presburger Arithmetic Is Hard
- Existence of unimodular triangulations -- positive results
- 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
- Polyhedral omega: a new algorithm for solving linear Diophantine systems
- Tight complexity lower bounds for integer linear programming with few constraints
- About the Complexity of Two-Stage Stochastic IPs
- Heat-bath random walks with Markov bases
- Empowering the configuration-IP: new PTAS results for scheduling with setup times
- Reciprocal class of jump processes
- Computing with an algebraic-perturbation variant of Barvinok's algorithm
- Combinatorial \(n\)-fold integer programming and applications
- Combinatorial \(n\)-fold integer programming and applications
Uses Software
This page was built for publication: Algebraic and geometric ideas in the theory of discrete optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904855)
