FPTAS for mixed-integer polynomial optimization with a fixed number of variables

DOI10.1145/1109557.1109638zbMath1192.90129arXivmath/0505677OpenAlexW3101186735MaRDI QIDQ3581508

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

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0505677

Mathematics Subject Classification ID

Mixed integer programming (90C11) Computational aspects related to convexity (52B55) Approximation algorithms (68W25)

Related Items

Simple solution methods for separable mixed linear and quadratic knapsack problem

Uses Software

• LattE