An integer L-shaped algorithm for time-constrained traveling salesman problem with stochastic travel and service times
10.1142/S0217595904000229
Saved in:
Main Authors: | Teng, S.Y., Ong, H.L., Huang, H.C. |
---|---|
Other Authors: | INDUSTRIAL & SYSTEMS ENGINEERING |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/63010 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
A stochastic dynamic traveling salesman problem with hard time windows
by: Chang, T.-S., et al.
Published: (2013) -
Integrated aircraft routing and crew pairing problem by benders decomposition
by: LIANG ZHE
Published: (2010) -
Solving traveling salesman problems by genetic algorithms
by: Liang, Y., et al.
Published: (2014) -
Solving traveling salesman problems using generalized chromosome genetic algorithm
by: Yang, J., et al.
Published: (2014) -
On parameter settings of Hopfield networks applied to traveling salesman problems
by: Tan, K.C., et al.
Published: (2014)