A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
10.1016/j.ejor.2017.10.017
Saved in:
Main Authors: | Tian Liu, Zhixing Luo, Hu Qin, LIM LEONG CHYE, ANDREW |
---|---|
Other Authors: | INDUSTRIAL SYSTEMS ENGINEERING AND MANAGEMENT |
Format: | Article |
Language: | English |
Published: |
Elsevier
2020
|
Subjects: | |
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/167604 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Language: | English |
Similar Items
-
A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing
by: LI CHONGSHOU, et al.
Published: (2020) -
Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction
by: Zhenzhen Zhang, et al.
Published: (2020) -
A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
by: Lijun Wei, et al.
Published: (2020) -
A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation
by: Zhixing Luo, et al.
Published: (2020) -
Production planning with flexible customization using a branch-price-cut method
by: Ng, T.S., et al.
Published: (2014)