Login / Signup

Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints.

Ka Io WongMichael G. H. Bell
Published in: Int. Trans. Oper. Res. (2006)
Keyphrases
  • multi dimensional
  • capacity constraints
  • network flow
  • lagrangian relaxation
  • minimum cost
  • dynamic programming
  • column generation
  • linear programming
  • approximation algorithms
  • lower and upper bounds