Results 21 to 30 of about 385 (87)
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
EURO Journal on Computational Optimization, 2018 In this paper, we present a state-of-the-art branch-and-cut (B&C) algorithm for the multicommodity capacitated fixed charge network design problem (MCND).
Mervat Chouman +2 more
doaj
Portfolio optimization with two coherent risk measures
, 2020 We provide analytical results for a static portfolio optimization problem with two coherent risk measures. The use of two risk measures is motivated by joint decision-making for portfolio selection where the risk perception of the portfolio manager is of
Aktürk, Tahsin Deniz, Ararat, Çağın
core +2 more sources
Solution methodologies for debris removal in disaster response
EURO Journal on Computational Optimization, 2016 During the disaster response phase of the emergency relief, the aim is to reduce loss of human life by reaching disaster affected areas with relief items as soon as possible. Debris caused by the disaster blocks the roads and prevents emergency aid teams
Nihal Berktaş +2 more
doaj
Restrict-and-relax search for 0-1 mixed-integer programs
EURO Journal on Computational Optimization, 2013 A highly desirable characteristic of methods for solving 0-1 mixed-integer programs is that they should be capable of producing high-quality solutions quickly.
Menal Guzelsoy +2 more
doaj
Reflections on generating (disjunctive) cuts
EURO Journal on Computational Optimization, 2013 We consider the problem of constructing generic supporting hyperplanes to be used within a (branch and) bound-and-cut algorithm. We review some of the properties that these hyperplanes should enjoy.
Florent Cadoux, Claude Lemaréchal
doaj
The complete vertex p-center problem
EURO Journal on Computational Optimization, 2020 The vertex p-center problem consists of locating p facilities among a set of M potential sites such that the maximum distance from any demand to its closest located facility is minimized.
F.Antonio Medrano
doaj
Intersection cuts from multiple rows: a disjunctive programming approach
EURO Journal on Computational Optimization, 2013 We address the issue of generating cutting planes for mixed integer programs from multiple rows of the simplex tableau with the tools of disjunctive programming.
Egon Balas, Andrea Qualizza
doaj
Joint location and pricing within a user-optimized environment
EURO Journal on Computational Optimization, 2020 In the design of service facilities, whenever the behaviour of customers is impacted by queueing or congestion, the resulting equilibrium cannot be ignored by a firm that strives to maximize revenue within a competitive environment.
Teodora Dan +2 more
doaj
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
EURO Journal on Computational Optimization, 2017 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.
C. Gentile, G. Morales-España, A. Ramos
doaj