Login / Signup

Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive.

Dimitri WatelAlain Faye
Published in: Theor. Comput. Sci. (2018)
Keyphrases
  • parameterized complexity
  • fixed parameter tractable
  • global constraints
  • np hard
  • approximation algorithms
  • np complete
  • column generation
  • symmetry breaking
  • search algorithm