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

被引：2
|
作者：
De Loera, J. A. [1 ]
Hemmecke, R. [2 ]
Koeppe, M. [2 ]
Weismantel, R. [2 ]
机构：
[1] Univ Calif Davis, Dept Math, Davis, CA 95616 USA
[2] Otto von Guericke Univ, FMA IMO, D-39106 Magdeburg, Germany
来源：
PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2006年
关键词：
D O I：
10.1145/1109557.1109638
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：743 / +
页数：2
相关论文
共 50 条
  • [1] FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
    Jesús A. De Loera
    Raymond Hemmecke
    Matthias Köppe
    Robert Weismantel
    Mathematical Programming, 2008, 115 : 273 - 290
  • [2] FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
    De Loera, Jesus A.
    Hemmecke, Raymond
    Koeppe, Matthias
    Weismantel, Robert
    MATHEMATICAL PROGRAMMING, 2008, 115 (02) : 273 - 290
  • [3] Granularity for Mixed-Integer Polynomial Optimization Problems
    Eggen, Carl
    Stein, Oliver
    Volkwein, Stefan
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2025, 205 (02)
  • [4] Univariate parameterization for global optimization of mixed-integer polynomial problems
    Teles, Joao P.
    Castro, Pedro M.
    Matos, Henrique A.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 229 (03) : 613 - 625
  • [5] On mixed-integer sets with two integer variables
    Dash, Sanjeeb
    Dey, Santanu S.
    Guenluek, Oktay
    OPERATIONS RESEARCH LETTERS, 2011, 39 (05) : 305 - 309
  • [6] Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
    Letchford, Adam N.
    Souli, Georgia
    OPERATIONS RESEARCH LETTERS, 2020, 48 (03) : 240 - 244
  • [7] Global optimization of mixed-integer nonlinear (polynomial) programming problems: the Bernstein polynomial approach
    Bhagyesh V. Patil
    P. S. V. Nataraj
    Sharad Bhartiya
    Computing, 2012, 94 : 325 - 343
  • [8] A mixed-integer approximation of robust optimization problems with mixed-integer adjustments
    Kronqvist, Jan
    Li, Boda
    Rolfes, Jan
    OPTIMIZATION AND ENGINEERING, 2024, 25 (03) : 1271 - 1296
  • [9] Global optimization of mixed-integer nonlinear (polynomial) programming problems: the Bernstein polynomial approach
    Patil, Bhagyesh V.
    Nataraj, P. S. V.
    Bhartiya, Sharad
    COMPUTING, 2012, 94 (2-4) : 325 - 343
  • [10] Mixed-integer nonlinear optimization
    Belotti, Pietro
    Kirches, Christian
    Leyffer, Sven
    Linderoth, Jeff
    Luedtke, James
    Mahajan, Ashutosh
    ACTA NUMERICA, 2013, 22 : 1 - 131
12345