Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction
Transportation Science
Saved in:
Main Authors: | Zhenzhen Zhang, Zhixing Luo, Hu Qin, Andrew Lim |
---|---|
Other Authors: | INDUSTRIAL SYSTEMS ENGINEERING AND MANAGEMENT |
Format: | Article |
Language: | English |
Published: |
Informs
2020
|
Subjects: | |
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/167511 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Language: | English |
Similar Items
-
A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
by: Tian Liu, et al.
Published: (2020) -
MEASURES AND ALGORITHMS FOR THE EXACT SATISFIABILITY PROBLEM AND ITS VARIANTS
by: HOI CHI KIT GORDON
Published: (2021) -
A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing
by: LI CHONGSHOU, 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) -
Branch and bound on the network model
by: Jain, S.
Published: (2013)