Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[HTML][HTML] Assessment of a two-step approach for global optimization of mixed-integer polynomial programs using quadratic reformulation
This paper revisits the approach of transforming a mixed-integer polynomial program
(MIPOP) into a mixed-integer quadratically-constrained program (MIQCP), in the light of …
(MIPOP) into a mixed-integer quadratically-constrained program (MIQCP), in the light of …
Reduced RLT representations for nonconvex polynomial programming problems
This paper explores equivalent, reduced size Reformulation-Linearization Technique (RLT)-
based formulations for polynomial programming problems. Utilizing a basis partitioning …
based formulations for polynomial programming problems. Utilizing a basis partitioning …
Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
In this paper, we propose two sets of theoretically filtered bound-factor constraints for
constructing reformulation-linearization technique (RLT)-based linear programming (LP) …
constructing reformulation-linearization technique (RLT)-based linear programming (LP) …
RLT-POS: Reformulation-Linearization Technique-based optimization software for solving polynomial programming problems
In this paper, we introduce a Reformulation-Linearization Technique-based open-source
optimization software for solving polynomial programming problems (RLT-POS). We present …
optimization software for solving polynomial programming problems (RLT-POS). We present …
Global optimization of general nonconvex problems with intermediate polynomial substructures
K Zorn, NV Sahinidis - Journal of Global Optimization, 2014 - Springer
This work considers the global optimization of general nonconvex nonlinear and mixed-
integer nonlinear programming problems with underlying polynomial substructures. We …
integer nonlinear programming problems with underlying polynomial substructures. We …
Discrete and continuous nonconvex optimization: decision trees, valid inequalities, and reduced basis techniques
E Dalkiran - 2011 - vtechworks.lib.vt.edu
This dissertation addresses the modeling and analysis of a strategic risk management
problem via a novel decision tree optimization approach, as well as development of …
problem via a novel decision tree optimization approach, as well as development of …
Relaxações tratáveis para problemas de otimização cúbicos restritos à esfera
OS Chumbes - 2019 - pantheon.ufrj.br
Diversos problemas encontrados em diferentes áreas da indústria podem ser formulados
como um problema de otimizaçao. Em problemas de otimizaçao, procuramos minimizar ou …
como um problema de otimizaçao. Em problemas de otimizaçao, procuramos minimizar ou …
[PDF][PDF] Relaxaçoes lineares eficientes para problemas de otimizaç ao polinomial
O Sarmiento, M Fampa - din.uem.br
Neste trabalho, abordamos um problema de otimizaçao global definido por polinômios. Este
problema generaliza diversos problemas de otimizaçao, como por exemplo, problemas de …
problema generaliza diversos problemas de otimizaçao, como por exemplo, problemas de …