Results 21 to 30 of about 182 (91)
Joint location and pricing within a user-optimized environment
EURO Journal on Computational Optimization, 2020 In the design of service facilities, whenever the behaviour of customers is impacted by queueing or congestion, the resulting equilibrium cannot be ignored by a firm that strives to maximize revenue within a competitive environment.
Teodora Dan +2 more
doaj +1 more source
Open Mathematics, 2017 Nowadays, nature–inspired metaheuristic algorithms are most powerful optimizing algorithms for solving the NP–complete problems. This paper proposes three approaches to find near–optimal Golomb ruler sequences based on nature–inspired algorithms in a ...
Bansal Shonak +2 more
doaj +1 more source
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
Open Mathematics, 2017 This paper presents a branch-delete-bound algorithm for effectively solving the global minimum of quadratically constrained quadratic programs problem, which may be nonconvex.
Hou Zhisong +3 more
doaj +1 more source
A parametric linearizing approach for quadratically inequality constrained quadratic programs
Open Mathematics, 2018 In this paper we propose a new parametric linearizing approach for globally solving quadratically inequality constrained quadratic programs. By utilizing this approach, we can derive the parametric linear programs relaxation problem of the investigated ...
Jiao Hongwei, Chen Rongjiang
doaj +1 more source
EURO Journal on Computational Optimization, 2016 For many practical applications it is important to determine not only a numerical approximation of one but a representation of the whole set of globally optimal solutions of a non-convex optimization problem.
Gabriele Eichfelder +2 more
doaj +1 more source
EURO Journal on Computational Optimization, 2020 The concept of leader-follower (or Stackelberg) equilibrium plays a central role in a number of real-world applications bordering on mathematical optimization and game theory.
Nicola Basilico +3 more
doaj +1 more source
Open Mathematics, 2018 In this paper, we present an effective algorithm for globally solving quadratic programs with quadratic constraints, which has wide application in engineering design, engineering optimization, route optimization, etc.
Tang Shuai, Chen Yuzhen, Guo Yunrui
doaj +1 more source
Alternative SDP and SOCP approximations for polynomial optimization
EURO Journal on Computational Optimization, 2019 In theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP).
Xiaolong Kuang +3 more
doaj +1 more source
A new branch and bound algorithm for minimax ratios problems
Open Mathematics, 2017 This study presents an efficient branch and bound algorithm for globally solving the minimax fractional programming problem (MFP). By introducing an auxiliary variable, an equivalent problem is firstly constructed and the convex relaxation programming ...
Zhao Yingfeng, Liu Sanyang, Jiao Hongwei
doaj +1 more source
A bounded degree SOS hierarchy for polynomial optimization
EURO Journal on Computational Optimization, 2017 We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem (P):f∗=min{f(x):x∈K} on a compact basic semi-algebraic set K⊂Rn.
JeanB. Lasserre +2 more
doaj +1 more source