Integral Function Bases
Raymond Hemmecke, Robert Weismantel
Abstract
Integral bases, a minimal set of solutions to Ax≤ b, x∈n that generate any other solution to Ax≤ b, x∈n, as a nonnegative integer linear combination, are always finite and are at the core of the Integral Basis Method introduced by Haus, Köppe and Weismantel. In this paper we present one generalization of the notion of integral bases to the nonlinear situation with the intention of creating an integral basis method also for nonlinear integer programming.
Create a lesson
Related papers
Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates
David Martínez-Rubio, Cristóbal Guzmán
The First-Order Oracle Complexity of Lipschitz Convex Optimization in Nondual Settings
David Martínez-Rubio, Brian Bullins, Cristóbal Guzmán et al.
Complexity Of Output Feedback Stabilization
Amir Ali Ahmadi, Abraar Chaudhry, Ijay Narang et al.
Convergence rate of the moment-SOS hierarchy for univariate polynomial optimization
Didier Henrion, Mohab Safey El Din
Geometry and Convergence of Quadratically Regularized Optimal Transport I
Alberto González-Sanz, Marcel Nutz
Constraint Qualifications and Gradient Flows for Block Vanishing Constraint Problems
Julian Niederer, Christoph Hansknecht, Andreas Potschka et al.