Results 21 to 30 of about 54 (54)
The summed start-up costs in a unit commitment problem
EURO Journal on Computational Optimization, 2017 We consider the sum of the incurred start-up costs of a single unit in a Unit Commitment problem. Our major result is a correspondence between the facets of its epigraph and some binary trees for concave start-up cost functions CU, which is bijective if ...
René Brandenberg +2 more
doaj +1 more source
Towards optimizing the deployment of optical access networks
EURO Journal on Computational Optimization, 2014 In this paper we study the cost-optimal deployment of optical access networks considering variants of the problem such as fiber to the home (FTTH), fiber to the building (FTTB), fiber to the curb (FTTC), or fiber to the neighborhood (FTTN).
Martin Grötschel +2 more
doaj +1 more source
EURO Journal on Computational Optimization, 2018 An elementary, but fundamental, operation in disjunctive programming is a basic step, which is the intersection of two disjunctions to form a new disjunction.
DimitriJ. Papageorgiou +1 more
doaj +1 more source
Speeding up column generation for robust wireless network planning
EURO Journal on Computational Optimization, 2013 The wireless network planning problem consists of base station placement and traffic node assignment to base stations. To incorporate traffic demand uncertainties, we follow the Γ-robustness approach by Bertsimas and Sim.
Grit Claßen +2 more
doaj +1 more source
A MIP framework for non-convex uniform price day-ahead electricity auctions
EURO Journal on Computational Optimization, 2017 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 ...
Mehdi Madani, Mathieu Van Vyve
doaj +1 more source
An improved cut-and-solve algorithm for the single-source capacitated facility location problem
EURO Journal on Computational Optimization, 2018 In this paper, we present an improved cut-and-solve algorithm for the single-source capacitated facility location problem. The algorithm consists of three phases.
SuneLauth Gadegaard +2 more
doaj +1 more source
Bilevel programming for price-based electricity auctions: a revenue-constrained case
EURO Journal on Computational Optimization, 2015 This paper describes the application of bilevel programming to a class of real-life problems in the field of electric power systems. Within the context of electricity markets, market-clearing procedures, i.e., auction models, are used by an independent ...
Ricardo Fernández-Blanco +2 more
doaj +1 more source
Planeación de sistemas secundarios de distribución usando el algoritmo Branch and Bound
Ingeniería y Ciencia, 2011 En este trabajo se plantea una metodología para la solución del problema delplaneamiento de sistemas secundarios de distribución considerando un modelode programación lineal entero mixto (PLEM), el cual considera la ubicación y dimensionamiento de ...
Carlos Javier Tapias-Isaza +2 more
doaj
Evaluating the quality of image matrices in blockmodeling
EURO Journal on Computational Optimization, 2015 One approach for analyzing large networks is to partition its nodes into classes where the nodes in a class have similar characteristics with respect to their connections in the network. A class is represented as a blockmodel (or image matrix).
Stefan Wiesberg, Gerhard Reinelt
doaj +1 more source
Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
EURO Journal on Computational Optimization, 2019 We consider nonlinear and nonsmooth mixing aspects in gas transport optimization problems. As mixed-integer reformulations of pooling-type mixing models already render small-size instances computationally intractable, we investigate the applicability of ...
FalkM. Hante, Martin Schmidt
doaj +1 more source