The Solution of some 100-city Travelling Salesman Problems
A simplex-based FORTRAN code, working entirely in integer arithmetic, has been developed for the exact solution of travelling-salesman problems. The code adds tour-barring constraints as they are found to be violated. It deals with fractional solutions by adding two-matching constraints and as a las...
Na minha lista:
| 主要作者: | |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Elsevier
2021-01-01
|
| 叢編: | EURO Journal on Computational Optimization |
| 主題: | |
| 在線閱讀: | http://www.sciencedirect.com/science/article/pii/S2192440621001441 |
| 標簽: |
沒有標簽, 成為第一個標記此記錄!
|