A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation
10.1287/trsc.2017.0772
Saved in:
Main Authors: | Zhixing Luo, Mengyang Liu, Lim Leong Chye, Andrew |
---|---|
Other Authors: | INDUSTRIAL SYSTEMS ENGINEERING AND MANAGEMENT |
Format: | Article |
Language: | English |
Published: |
informs
2020
|
Subjects: | |
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/167646 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Language: | English |
Similar Items
-
Solving dial-a-ride problems using multiple ant colony system with fleet size minimisation
by: Tripathy, Twinkle, et al.
Published: (2020) -
A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing
by: LI CHONGSHOU, et al.
Published: (2020) -
A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
by: Tian Liu, et al.
Published: (2020) -
Production planning with flexible customization using a branch-price-cut method
by: Ng, T.S., et al.
Published: (2014) -
Production planning with flexible customization using a branch-price-cut method
by: Adam Ng, T.S., et al.
Published: (2014)