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

DOI10.1145/1109557.1109638MaRDI QIDQ3581508zbMATH OpenOpenAlexFDO

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

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

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

Abstract: We show the existence of an FPTAS for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed.

Cited in

(1)

• Simple solution methods for separable mixed linear and quadratic knapsack problem

Describes a project that uses

Uses Software

• LattE

This page was built for publication: FPTAS for mixed-integer polynomial optimization with a fixed number of variables

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