Sciweavers

725 search results - page 51 / 145
» heuristics 2010
Sort
View
COR
2010
152views more  COR 2010»
13 years 10 months ago
Variable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
Sophie N. Parragh, Karl F. Doerner, Richard F. Har...
ENDM
2010
141views more  ENDM 2010»
13 years 10 months ago
Solving Replica Placement and Request Distribution in Content Distribution Networks
A Content Distribution Network (CDN) is an overlay network where servers replicate contents and distribute client's requests with the aim at reducing delay, server load and n...
Tiago Araújo Neves, Lúcia Maria de A...
ENDM
2010
136views more  ENDM 2010»
13 years 10 months ago
Approximating the asymmetric profitable tour
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
EOR
2010
99views more  EOR 2010»
13 years 10 months ago
Mathematical programming models for revenue management under customer choice
We study a network airline revenue management problem with discrete customer choice behavior. We discuss a choice model based on the concept of preference orders, in which custome...
Lijian Chen, Tito Homem-de-Mello
EOR
2010
96views more  EOR 2010»
13 years 10 months ago
The hybrid flow shop scheduling problem
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...
Rubén Ruiz, José Antonio Vázq...