Satisficing measure approach for vehicle routing problem with time windows under uncertainty
European Journal of Operational Research, 2016 - Elsevier
The complexity of evaluating chance constraints makes chance-constrained programming
problem difficult to solve. One way to handle this complexity is by devising satisficing …
problem difficult to solve. One way to handle this complexity is by devising satisficing …
Satisficing measure approach for vehicle routing problem with time windows under uncertainty
VA Nguyen, J Jiang, KM Ng… - European Journal Of …, 2016 - infoscience.epfl.ch
The complexity of evaluating chance constraints makes chance-constrained programming
problem difficult to solve. One way to handle this complexity is by devising satisficing …
problem difficult to solve. One way to handle this complexity is by devising satisficing …
Satisficing measure approach for vehicle routing problem with time windows under uncertainty
VA Nguyen, J Jiang, KM Ng, KM Teo - European Journal of Operational …, 2016 - infona.pl
The complexity of evaluating chance constraints makes chance-constrained programming
problem difficult to solve. One way to handle this complexity is by devising satisficing …
problem difficult to solve. One way to handle this complexity is by devising satisficing …