EURO Journal on Computational Optimization
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Decentralized personalized federated learning: Lower bounds and optimal algorithm for all personalization modes
EURO Journal on Computational Optimization - Tập 10 - Trang 100041 - 2022
New exact solution approaches for the split delivery vehicle routing problem
EURO Journal on Computational Optimization - Tập 6 - Trang 85-115 - 2018
An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in $$\mathbb {R}^n$$
EURO Journal on Computational Optimization - Tập 7 - Trang 177-207 - 2018
In this work, we present an efficient strongly polynomial algorithm for the
projection of a point on the intersection of two hyperplanes and a box in
$$\mathbb {R}^n$$ . Interior point methods are the most efficient algorithm in
the literature to solve this problem. While efficient in practice, the
complexity of interior-point methods is bounded by a polynomial in the dimension
of the problem and ...
A MIP framework for non-convex uniform price day-ahead electricity auctions
EURO Journal on Computational Optimization - Tập 5 - Trang 263-284 - 2015
It is well known that a market equilibrium with uniform prices often does not
exist in non-convex day-ahead electricity auctions. We consider the case of the
non-convex, uniform-price Pan-European day-ahead electricity market “PCR” (Price
Coupling of Regions), with non-convexities arising from so-called complex and
block orders. Extending previous results, we propose a new primal-dual framework
fo...
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
EURO Journal on Computational Optimization - Tập 4 - Trang 27-46 - 2015
We analyze the proximal alternating linearized minimization algorithm (PALM) for
solving non-smooth convex minimization problems where the objective function is
a sum of a smooth convex function and block separable non-smooth extended
real-valued convex functions. We prove a global non-asymptotic sublinear rate of
convergence for PALM. When the number of blocks is two, and the smooth coupling
func...
Two decades of blackbox optimization applications
EURO Journal on Computational Optimization - Tập 9 - Trang 100011 - 2021
Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
EURO Journal on Computational Optimization - Tập 1 - Trang 283-312 - 2013
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
EURO Journal on Computational Optimization - Tập 5 - Trang 177-201 - 2016
This paper provides the convex hull description of the single thermal Unit
Commitment (UC) problem with the following basic operating constraints: (1)
generation limits, (2) start-up and shut-down capabilities, and (3) minimum up
and down times. The proposed constraints can be used as the core of any unit
commitment formulation to strengthen the lower bound in enumerative approaches.
We provide ev...
Solving wind farm layout optimization with mixed integer programs and constraint programs
EURO Journal on Computational Optimization - Tập 2 - Trang 195-219 - 2014
The wind farm layout optimization problem is concerned with the optimal location
of turbines within a fixed geographical area to maximize profit under stochastic
wind conditions. Previously, it has been modeled as a maximum diversity (or
$$p$$ -dispersion-sum) problem, but such a formulation cannot capture the
nonlinearity of aerodynamic interactions among multiple wind turbines. We
present the fi...
Tổng số: 171
- 1
- 2
- 3
- 4
- 5
- 6
- 10