Results 51 to 60 of about 411 (101)
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
EURO Journal on Computational Optimization, 2014 We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem.
Bernard Gendron, Mathieu Larose
doaj +1 more source
Approximation of corner polyhedra with families of intersection cuts
, 2017 We study the problem of approximating the corner polyhedron using intersection cuts derived from families of lattice-free sets in $\mathbb{R}^n$. In particular, we look at the problem of characterizing families that approximate the corner polyhedron up ...
A Basu +12 more
core +1 more source
Core group placement: allocation and provisioning of heterogeneous resources
EURO 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
EURO 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
Convex approximations for complete integer recourse models [PDF]
We consider convex approximations of the expected value function of a two-stage integer recourse problem. The convex approximations are obtained by perturbing the distribution of the random right-hand side vector.
Vlerk, Maarten H. van der
core +1 more source
Multi-machine energy-aware scheduling
EURO Journal on Computational Optimization, 2017 The traditional set of manufacturing scheduling problems concern general and easy-to-measure economic objectives such as makespan and tardiness. The variable nature of energy costs over the course of the day remains mostly ignored by most previous ...
David Van Den Dooren +4 more
doaj +1 more source
Implicitly and densely discrete black-box optimization problems [PDF]
, 2008 This paper addresses derivative-free optimization problems where the variables lie implicitly in an unknown discrete closed set. The evaluation of the objective function follows a projection onto the discrete set, which is assumed dense rather than ...
Vicente, L. N.
core
An ALM Model for Pension Funds using Integrated Chance Constraints [PDF]
We discuss integrated chance constraints in their role of short-term risk constraints in a strategic ALM model for Dutch pension funds. The problem is set up as a multistage recourse model, with special attention for modeling the guidelines proposed by ...
Klein Haneveld, W.K.. +2 more
core +1 more source
On multiple simple recourse models [PDF]
We consider multiple simple recourse (MSR) models, both continuous and integer versions, which generalize the corresponding simple recourse (SR) models by allowing for a refined penalty cost structure for individual shortages and surpluses.
Vlerk, Maarten H. van der
core +1 more source
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