A Polyhedral Frobenius Theorem with Applications to Integer Optimization

DOI10.1137/14M0973694zbMath1317.90200OpenAlexW944513539MaRDI QIDQ5499737

Robert Weismantel, David Adjiashvili, Timm Oertel

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)

Related Items (3)

Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube ⋮ The Distributions of Functions Related to Parametric Integer Optimization ⋮ Enumerating Projections of Integer Points in Unbounded Polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
• \(N\)-fold integer programming
• Lattice translates of a polytope and the Frobenius problem
• Geometric algorithms and combinatorial optimization
• Complexity of the Frobenius problem
• Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane
• Feasibility of Integer Knapsacks
• Convex and Discrete Geometry
• Integer quadratic programming in the plane
• Integer Polynomial Optimization in Fixed Dimension
• On a linear diophantine problem of Frobenius
• Convex separable optimization is not much harder than linear optimization
• On a Problem of Partitions

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