|
- Single Machine Scheduling Problem: C++ implementation of Carlier's branch & bound
zip file here
- Single Machine Scheduling Problem:
ECLiPSe
formulation here
- Probabilistic Traveling Salesman Problem:
- check of 1-shift and 2-p-opt local search operators as appeared
in Bertsimas and Howell, Further results on the probabilistic traveling
salesman problem. EJOR 65:68-95, 1993.
C file here
- check of 2-p-opt operator as appeared in Bertsimas, Probabilistic
combinatorial optimization problems. PhD thesis, MIT, Cambridge, MA, 1988.
C file here
Last update: May 2004
|