scientific article; zbMATH DE number 6135816

Raymond Hemmecke, Matthias Köppe, Jesús A. De Loera

Publication date: 12 February 2013

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational aspects in algebraic geometry (14Q99)

Related Items (53)

Reciprocal class of jump processes ⋮ Petri Net Reductions for Counting Markings ⋮ The fiber dimension of a graph ⋮ Polyhedral omega: a new algorithm for solving linear Diophantine systems ⋮ About the Complexity of Two-Stage Stochastic IPs ⋮ A polyhedral model of partitions with bounded differences and a bijective proof of a theorem of Andrews, Beck, and Robbins ⋮ Sublinear circuits for polyhedral sets ⋮ Quadratic diameter bounds for dual network flow polyhedra ⋮ On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond ⋮ Enumerating Integer Points in Polytopes with Bounded Subdeterminants ⋮ An algebraic-perturbation variant of Barvinok's algorithm ⋮ Bouquet algebra of toric ideals ⋮ Short Presburger Arithmetic Is Hard ⋮ On lattice point counting in \(\varDelta\)-modular polyhedra ⋮ Solving MIPs via scaling-based augmentation ⋮ Ameso optimization: a relaxation of discrete midpoint convexity ⋮ A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs ⋮ Heat-bath random walks with Markov bases ⋮ FACTORIZATION LENGTH DISTRIBUTION FOR AFFINE SEMIGROUPS III: MODULAR EQUIDISTRIBUTION FOR NUMERICAL SEMIGROUPS WITH ARBITRARILY MANY GENERATORS ⋮ Integer programming in parameterized complexity: five miniatures ⋮ High-multiplicity \(N\)-fold IP via configuration LP ⋮ Discrete Midpoint Convexity ⋮ Enumeration and unimodular equivalence of empty delta-modular simplices ⋮ On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices ⋮ \textsc{Sagbi} combinatorics of maximal minors and a \textsc{Sagbi} algorithm ⋮ Monomial Tropical Cones for Multicriteria Optimization ⋮ Combinatorial \(n\)-fold integer programming and applications ⋮ Computing with an algebraic-perturbation variant of Barvinok's algorithm ⋮ ALGEBRAIC AND GEOMETRIC PROPERTIES OF LATTICE WALKS WITH STEPS OF EQUAL LENGTH ⋮ Factorization length distribution for affine semigroups. II: Asymptotic behavior for numerical semigroups with arbitrarily many generators ⋮ A guide to conic optimisation and its applications ⋮ The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints ⋮ The complexity landscape of decompositional parameters for ILP ⋮ Efficient solutions for weight-balanced partitioning problems ⋮ Construction of all polynomial relations among Dedekind eta functions of level \(N\) ⋮ Toric fiber products versus Segre products ⋮ Parameterized shifted combinatorial optimization ⋮ Unnamed Item ⋮ An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets ⋮ Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes ⋮ Geometry of the Minimal Solutions of a Linear Diophantine Equation ⋮ Parity binomial edge ideals ⋮ Unnamed Item ⋮ Existence of unimodular triangulations — positive results ⋮ Composable computation in discrete chemical reaction networks ⋮ 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 ⋮ Empowering the configuration-IP: new PTAS results for scheduling with setup times ⋮ On the Length of Monotone Paths in Polyhedra ⋮ Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization ⋮ Lower bounds on the graver complexity of \(M\)-fold matrices

Uses Software

YALMIP

This page was built for publication: