Results 31 to 40 of about 78 (76)
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
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
Improving strong branching by domain propagation
EURO Journal on Computational Optimization, 2014 One of the essential components of a branch-and-bound based mixed-integer linear programming (MIP) solver is the branching rule. Strong branching is a method used by many state-of-the-art branching rules to select the variable to branch on.
Gerald Gamrath
doaj +1 more source
On global optimization with indefinite quadratics
EURO Journal on Computational Optimization, 2017 We present an algorithmic framework for global optimization problems in which the non-convexity is manifested as an indefinite-quadratic as part of the objective function.
Marcia Fampa, Jon Lee, Wendel Melo
doaj +1 more source
Matheuristics for optimizing the network in German wagonload traffic
EURO Journal on Computational Optimization, 2017 In this paper, we consider a capacitated multiple allocation hub location problem derived from a practical application in network design of German wagonload traffic.
Julia Sender +3 more
doaj +1 more source
Solving wind farm layout optimization with mixed integer programs and constraint programs
EURO Journal on Computational Optimization, 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)
PeterY. Zhang +3 more
doaj +1 more source