22 search results - page 2 / 5 » Solving a Location-Allocation Problem with Logic-Based Bende... |
EOR
2006
13 years 5 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
EOR
2010
13 years 5 months ago
2010
This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we manage a classical employee timetabling problem. At ...
CSCLP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
ANOR
2006
13 years 5 months ago
2006
In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. Our formulation is flexi...
IOR
2006
13 years 5 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...