A Polyhedral Frobenius Theorem with Applications to Integer Optimization

DOI10.1137/14M0973694MaRDI QIDQ5499737zbMATH OpenOpenAlexFDO

Authors David Adjiashvili, Timm Oertel, Robert Weismantel

Publication date 31 July 2015

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/14m0973694

zbMATH Keywords

nonlinear optimizationpolyhedronFrobenius probleminteger optimization

Mathematics Subject Classification ID

Integer programming (90C10) The Frobenius problem (11D07)

Recommendations

• An optimal lower bound for the Frobenius problem
• The Frobenius problem, rational polytopes, and Fourier-Dedekind sums
• Integer Polynomial Optimization in Fixed Dimension
• An FPTAS for minimizing indefinite quadratic forms over integers in polyhedra
• Theory and Applications of n-Fold Integer Programming
• Polyhedral approximation in mixed-integer convex optimization
• Polyhedral proof methods in combinatorial optimization
• FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
• Integer optimization on convex semialgebraic sets
• A new algebraic geometry algorithm for integer programming

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3176160 (Why is no real title available?)
• Complexity of the Frobenius problem
• Convex and Discrete Geometry
• Convex separable optimization is not much harder than linear optimization
• Feasibility of integer knapsacks
• Geometric algorithms and combinatorial optimization
• Integer Polynomial Optimization in Fixed Dimension
• Integer quadratic programming in the plane
• Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
• Lattice translates of a polytope and the Frobenius problem
• Minimizing cubic and homogeneous polynomials over integers in the plane
• On a Problem of Partitions
• On a linear diophantine problem of Frobenius
• \(N\)-fold integer programming

Cited in

(7)

• An optimal lower bound for the Frobenius problem
• The distributions of functions related to parametric integer optimization
• Enumerating projections of integer points in unbounded polyhedra
• Linear Programs and Convex Hulls Over Fields of Puiseux Fractions
• A note on ``On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
• Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube
• Fully Bounded Polyhedral Analysis of Integers with Wrapping

This page was built for publication: A Polyhedral Frobenius Theorem with Applications to Integer Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5499737)