EOR
2006
13 years 11 months ago
2006
As product life cycles shortened, many firms introduce new products and phase out old products frequently. To plan for a successful product rollover; i.e., introduce a new product...
EOR
2006
13 years 11 months ago
2006
We present a multistart heuristic for the uncapacitated facility location problem, based on a very successful method we originally developed for the p-median problem. We show exte...
EOR
2006
13 years 11 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
2006
13 years 11 months ago
2006
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...
EOR
2006
13 years 11 months ago
2006
This paper proposes a stochastic dynamic programming model for a short-term capacity planning model for air cargo space. The long-term cargo space is usually acquired by freight fo...
EOR
2006
13 years 11 months ago
2006
The Traveling Tournament Problem (TTP) [E. Easton, G. Nemhauser, M. Trick, The traveling tournament problem description and benchmarks, in: Proceedings of the 7th International Co...
EOR
2006
13 years 11 months ago
2006
The yard allocation problem (YAP) is a real-life resource allocation problem faced by the Port of Singapore Authority (PSA). As the problem is NP-hard, we propose an effective met...
EOR
2006
13 years 11 months ago
2006
This paper addresses the railway rolling stock circulation problem. Given the departure and arrival times as well as the expected numbers of passengers, we have to assign the roll...
EOR
2006
13 years 11 months ago
2006
We propose a multivariate statistical framework for regional development assessment based on structural equation modelling with latent variables and show how such methods can be c...
EOR
2006
13 years 11 months ago
2006
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...