Results 111 to 120 of about 724 (154)

Distributed Nonconvex Optimization for Control of Water Networks with Time-coupling Constraints. [PDF]

Water Resour Manag (Dordr)
Jenks B, Ulusoy AJ, Pecci F, Stoianov I.
europepmc   +1 more source

Efficient scheduling of multiple software projects for work continuity and identical completion time. [PDF]

MethodsX
Aldhubaiban A, AlMatouq A.
europepmc   +1 more source

Operation optimisation of direct current microgrids toward stability and economy: a model-data co-driven framework. [PDF]

Commun Eng
Zhu Y, Wang F, Lin Z, Fleming J.
europepmc   +1 more source

Exact solutions of polynomial programs through quadratic convex reformulations: theory and applications

, 2021
openaire   +1 more source

Using general triangle inequalities within quadratic convex reformulation method [PDF]

Optimization Methods and Software, 2023
We consider the exact solution of Problem $\QP$ which consists in minimizing a quadratic function subject to quadratic constraints. We start with an explicit description of new general triangle inequalities that are derived from the ranges of the variables of $\QP$.
Amélie Lambert
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Quadratic convex reformulation for quadratic programming with linear on–off constraints

European Journal of Operational Research, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Duan Li, Rujun Jiang, Baiyi Wu
exaly   +3 more sources

Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints

Optimization Letters, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John Mitchell, Jong-Shi Pang, Mitchell John E   +2 more
exaly   +3 more sources

A Note on Convex Reformulation Schemes for Mixed Integer Quadratic Programs

Journal of Optimization Theory and Applications, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ali M M
exaly   +2 more sources

Testing the Non-Diagonal Quadratic Convex Reformulation Technique

Computer Aided Chemical Engineering, 2016
Abstract Ji et al. (2012) introduced a new reformulation technique for general 0-1 quadratic programs. They did not name it so we call it Non-Diagonal Quadratic Convex Reformulation (NDQCR). The reformulation technique is based on the Quadratic Convex Reformulation method developed by Billionnet et al. (2009, 2012, 2013).
Tapio Westerlund
exaly   +2 more sources

Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint

Journal of Global Optimization, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaojin Zheng, Xueting Cui, Yutong Pan   +2 more
exaly   +2 more sources