Results 61 to 70 of about 385 (87)
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
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
Exact solutions to a class of stochastic generalized assignment problems [PDF]
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed.
Albareda-Sambola, Maria +2 more
core +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
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
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
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
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
Optimizing compatible sets in wireless networks through integer programming
EURO Journal on Computational Optimization, 2014 In wireless networks, the notion of compatible set refers to a set of radio links that can be simultaneously active with a tolerable interference. Finding a compatible set with maximum weighted revenue from the parallel transmissions is an important ...
Yuan Li +3 more
doaj
EURO 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