Results 1 to 9 of about 9 (9)

Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints

open access: yesEURO Journal on Computational Optimization, 2017
This paper elaborates compact MIP formulations for a discrete unit commitment problem with minimum stop and ramping constraints. The variables can be defined in two different ways.
Nicolas Dupin
doaj   +1 more source

Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators

open access: yesEURO Journal on Computational Optimization, 2016
This paper addresses two variants of the routing and wavelength assignment problem arising in the context of optical transport networks. In both variants, we address the case where the physical coverage of the fiber network is such that regenerators, to ...
Amaro de Sousa   +2 more
doaj   +1 more source

Core group placement: allocation and provisioning of heterogeneous resources

open access: yesEURO Journal on Computational Optimization, 2019
We present a theoretical and empirical study on a recently introduced combinatorial optimization problem, namely core group placement problem. The problem arises from real-world business requirements as part of resource allocation in cloud management. In
Serdar Kadıoğlu
doaj   +1 more source

Road network emergency accessibility planning after a major earthquake

open access: yesEURO Journal on Computational Optimization, 2016
In the aftermath of disasters such as major earthquakes, several roads may be blocked by rubble and the population tends to search refugee in certain gathering points of the city.
CelsoSatoshi Sakuraba   +5 more
doaj   +1 more source
Home - About - Disclaimer - Privacy