| 청구기호 |
QA76.9.M35 |
| 판사항 |
1st ed. 2007.
|
| 형태사항 |
XVIII, 830 p. online resource.
|
| 총서명 |
Combinatorial Optimization, 1388-3011 ; 12
|
| 언어 |
English |
| 내용 |
The Traveling Salesman Problem: Applications, Formulations and Variations -- Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP -- Polyhedral Theory for the Asymmetric Traveling Salesman Problem -- Exact Methods for the Asymmetric Traveling Salesman Problem -- Approximation Algorithms for Geometric TSP -- Exponential Neighborhoods and Domination Analysis for the TSP -- Probabilistic Analysis of the TSP -- Local Search and Metaheuristics -- Experimental Analysis of Heuristics for the STSP -- Experimental Analysis of Heuristics for the ATSP -- Polynomially Solvable Cases of the TSP -- The Maximum TSP -- The Generalized Traveling Salesman and Orienteering Problems -- The Prize Collecting Traveling Salesman Problem and its Applications -- The Bottleneck TSP -- TSP Software.
|
| 주제 |
Computer science—Mathematics.
Mathematical optimization.
Operations research.
Decision making.
Algorithms.
Discrete Mathematics in Computer Science. --https://scigraph.springernature.com/ontologies/product-market-codes/I17028
Optimization. --https://scigraph.springernature.com/ontologies/product-market-codes/M26008
Operations Research/Decision Theory. --https://scigraph.springernature.com/ontologies/product-market-codes/521000
Algorithms. --https://scigraph.springernature.com/ontologies/product-market-codes/M14018
|
| 보유판 및 특별호 저록 |
Springer Nature eBook
Printed edition: 9781402006647
Printed edition: 9781475788068
Printed edition: 9780387444598
|
| ISBN |
9780306482137 |
| 기타 표준번호 |
10.1007/b101971 |
| QR CODE |
|
