Polyhedral studies on scheduling and routing problems
During the last decade, there have been major advances in solving a class of large-scale real world combinatorial optimization problems. Such problems are formulated as Travelling Salesman Problems (TSP), some involving up to thousands of cities. These achievements, mainly due to the use of so calle...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
University of British Columbia
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2429/32385 |