Login / Signup

Revised eight-step feasibility checking procedure with linear time complexity for the Dial-a-Ride Problem (DARP).

Somayeh SohrabiKoorush ZiaratiMorteza Keshtkaran
Published in: Comput. Oper. Res. (2024)
Keyphrases
  • worst case
  • matching procedure
  • data mining
  • column generation
  • machine learning
  • information retrieval
  • information systems
  • complexity theoretic