Sciweavers

127 search results - page 10 / 26
» eor 2008
Sort
View
EOR
2008
82views more  EOR 2008»
13 years 6 months ago
Solving the pallet loading problem
This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxe...
Gustavo H. A. Martins, Robert F. Dell
EOR
2008
84views more  EOR 2008»
13 years 6 months ago
Complexity of local search for the p-median problem
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
Ekaterina Alekseeva, Yury Kochetov, Alexander Plya...
EOR
2008
66views more  EOR 2008»
13 years 6 months ago
"Optimistic" weighted Shapley rules in minimum cost spanning tree problems
We introduce optimistic weighted Shapley rules in minimum cost spanning tree problems. We dene them as the weighted Shapley values of the optimistic game v+ introduced in Berganti
Gustavo Bergantiños, Silvia Lorenzo-Freire
EOR
2008
268views more  EOR 2008»
13 years 6 months ago
A survey of scheduling problems with setup times or costs
The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by [Allahverdi, A., Gupta, J.N.D., Aldowaisan, T., 1999. A review of s...
Ali Allahverdi, C. T. Ng, T. C. Edwin Cheng, Mikha...
EOR
2008
100views more  EOR 2008»
13 years 5 months ago
Urban rapid transit network capacity expansion
The rapid transit network design problem consists on the location of the train alignments and stations in an urban traffic context. The location problem incorporates the demand dec...
Ángel Marín, Patricia Jaramillo