Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
In pursuit of the traveling salesman [[electronic resource] ] : mathematics at the limits of computation / / William J. Cook
| In pursuit of the traveling salesman [[electronic resource] ] : mathematics at the limits of computation / / William J. Cook |
| Autore | Cook William <1957-> |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, 2012 |
| Descrizione fisica | 1 online resource (245 p.) |
| Disciplina | 511/.5 |
| Soggetto topico |
Traveling salesman problem
Computational complexity |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-283-33977-3
9786613339775 1-4008-3959-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- 1: Challenges -- 2: Origins of the Problem -- 3: The Salesman in Action -- 4: Searching for a Tour -- 5: Linear Programming -- 6: Cutting Planes -- 7: Branching -- 8: Big Computing -- 9: Complexity -- 10: The Human Touch -- 11: Aesthetics -- 12: Pushing the Limits -- Notes -- Bibliography -- Index |
| Record Nr. | UNINA-9910457894303321 |
Cook William <1957->
|
||
| Princeton, : Princeton University Press, 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
In pursuit of the traveling salesman [[electronic resource] ] : mathematics at the limits of computation / / William J. Cook
| In pursuit of the traveling salesman [[electronic resource] ] : mathematics at the limits of computation / / William J. Cook |
| Autore | Cook William <1957-> |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, 2012 |
| Descrizione fisica | 1 online resource (245 p.) |
| Disciplina | 511/.5 |
| Soggetto topico |
Traveling salesman problem
Computational complexity |
| ISBN |
1-283-33977-3
9786613339775 1-4008-3959-9 |
| Classificazione | MAT000000MAT025000 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- 1: Challenges -- 2: Origins of the Problem -- 3: The Salesman in Action -- 4: Searching for a Tour -- 5: Linear Programming -- 6: Cutting Planes -- 7: Branching -- 8: Big Computing -- 9: Complexity -- 10: The Human Touch -- 11: Aesthetics -- 12: Pushing the Limits -- Notes -- Bibliography -- Index |
| Record Nr. | UNINA-9910781565703321 |
|
Cook William <1957->
|
||
| Princeton, : Princeton University Press, 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Metaheuristics for combinatorial optimization / / editors, Salvatore Greco [et al.]
| Metaheuristics for combinatorial optimization / / editors, Salvatore Greco [et al.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (68 pages) |
| Disciplina | 519.6 |
| Collana | Advances in intelligent systems and computing |
| Soggetto topico |
Combinatorial optimization
Metaheuristics Traveling salesman problem |
| ISBN | 3-030-68520-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910484849103321 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The traveling salesman : computational solutions for TSP applications / / Gerhard Reinelt
| The traveling salesman : computational solutions for TSP applications / / Gerhard Reinelt |
| Autore | Reinelt G (Gerhard) |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [1994] |
| Descrizione fisica | 1 online resource (VIII, 223 p. 3 illus.) |
| Disciplina | 511.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Traveling salesman problem |
| ISBN | 3-540-48661-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Basic Concepts -- Related Problems and Applications -- Geometric Concepts -- Candidate Sets -- Construction Heuristics -- Improving Solutions -- Heuristics for Large Geometric Problems -- Further Heuristic Approaches -- Lower Bounds -- A Case Study: TSPs in Printed Circuit Board Production -- Practical TSP Solving. |
| Record Nr. | UNISA-996465830003316 |
|
Reinelt G (Gerhard)
|
||
| Berlin ; ; Heidelberg : , : Springer, , [1994] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.]
| The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.] |
| Autore | Applegate David L |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, c2006 |
| Descrizione fisica | 1 online resource (606 p.) |
| Disciplina | 511.6 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico | Traveling salesman problem |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-283-25611-8
9786613256119 1-4008-4110-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Chapter 1. The Problem -- Chapter 2. Applications -- Chapter 3. Dantzig, Fulkerson, and Johnson -- Chapter 4. History of TSP Computation -- Chapter 5. LP Bounds and Cutting Planes -- Chapter 6. Subtour Cuts and PQ-Trees -- Chapter 7. Cuts from Blossoms and Blocks -- Chapter 8. Combs from Consecutive Ones -- Chapter 9. Combs from Dominoes -- Chapter 10. Cut Metamorphoses -- Chapter 11. Local Cuts -- Chapter 12. Managing the Linear Programming Problems -- Chapter 13. The Linear Programming Solver Chapter 14. Branching -- Chapter 14. Branching -- Chapter 15. Tour Finding -- Chapter 16. Computation -- Chapter 17. The Road Goes On -- Bibliography -- Index |
| Record Nr. | UNINA-9910461477403321 |
|
Applegate David L
|
||
| Princeton, : Princeton University Press, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.]
| The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.] |
| Autore | Applegate David L |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, c2006 |
| Descrizione fisica | 1 online resource (606 p.) |
| Disciplina | 511.6 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico | Traveling salesman problem |
| Soggetto non controllato |
AT&T Labs
Accuracy and precision Addition Algorithm Analysis of algorithms Applied mathematics Approximation algorithm Approximation Basic solution (linear programming) Best, worst and average case Bifurcation theory Big O notation CPLEX CPU time Calculation Chaos theory Column generation Combinatorial optimization Computation Computational resource Computer Connected component (graph theory) Connectivity (graph theory) Convex hull Cutting-plane method Delaunay triangulation Determinism Disjoint sets Dynamic programming Ear decomposition Engineering Enumeration Equation Estimation Euclidean distance Euclidean space Family of sets For loop Genetic algorithm George Dantzig Georgia Institute of Technology Greedy algorithm Hamiltonian path Hospitality Hypergraph Implementation Instance (computer science) Institute Integer Iteration Linear inequality Linear programming Mathematical optimization Mathematics Model of computation Neuroscience Notation Operations research Optimization problem Order by Pairwise Parameter (computer programming) Parity (mathematics) Percentage Polyhedron Polytope Pricing Princeton University Processing (programming language) Project Quantity Reduced cost Requirement Result Rice University Rutgers University Scientific notation Search algorithm Search tree Self-similarity Simplex algorithm Solution set Solver Source code Special case Stochastic Subroutine Subsequence Subset Summation Test set Theorem Theory Time complexity Trade-off Travelling salesman problem Tree (data structure) Upper and lower bounds Variable (computer science) Variable (mathematics) |
| ISBN |
1-283-25611-8
9786613256119 1-4008-4110-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1. The Problem -- Chapter 2. Applications -- Chapter 3. Dantzig, Fulkerson, and Johnson -- Chapter 4. History of TSP Computation -- Chapter 5. LP Bounds and Cutting Planes -- Chapter 6. Subtour Cuts and PQ-Trees -- Chapter 7. Cuts from Blossoms and Blocks -- Chapter 8. Combs from Consecutive Ones -- Chapter 9. Combs from Dominoes -- Chapter 10. Cut Metamorphoses -- Chapter 11. Local Cuts -- Chapter 12. Managing the Linear Programming Problems -- Chapter 13. The Linear Programming Solver Chapter 14. Branching -- Chapter 14. Branching -- Chapter 15. Tour Finding -- Chapter 16. Computation -- Chapter 17. The Road Goes On -- Bibliography -- Index |
| Record Nr. | UNINA-9910789748903321 |
|
Applegate David L
|
||
| Princeton, : Princeton University Press, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The traveling salesman problem and its variations [[electronic resource] /] / edited by Gregory Gutin and Abraham P. Punnen
| The traveling salesman problem and its variations [[electronic resource] /] / edited by Gregory Gutin and Abraham P. Punnen |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Dordrecht ; ; Boston, : Kluwer Academic Publishers, c2002 |
| Descrizione fisica | 1 online resource (XVIII, 830 p.) |
| Disciplina | 511/.6 |
| Altri autori (Persone) |
GutinGregory <1957->
PunnenAbraham P |
| Collana | Combinatorial optimization |
| Soggetto topico |
Traveling salesman problem
Combinatorial optimization |
| Soggetto genere / forma | Electronic books. |
| ISBN | 0-306-48213-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910449923503321 |
| Dordrecht ; ; Boston, : Kluwer Academic Publishers, c2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The traveling salesman problem and its variations [[electronic resource] /] / edited by Gregory Gutin and Abraham P. Punnen
| The traveling salesman problem and its variations [[electronic resource] /] / edited by Gregory Gutin and Abraham P. Punnen |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Dordrecht ; ; Boston, : Kluwer Academic Publishers, c2002 |
| Descrizione fisica | 1 online resource (XVIII, 830 p.) |
| Disciplina | 511/.6 |
| Altri autori (Persone) |
GutinGregory <1957->
PunnenAbraham P |
| Collana | Combinatorial optimization |
| Soggetto topico |
Traveling salesman problem
Combinatorial optimization |
| ISBN | 0-306-48213-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910783696903321 |
| Dordrecht ; ; Boston, : Kluwer Academic Publishers, c2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Vehicle routing problem / / edited by Tonci Caric, Hrvoje Gold
| Vehicle routing problem / / edited by Tonci Caric, Hrvoje Gold |
| Pubbl/distr/stampa | Rijeka, Croatia : , : InTech, , [2008] |
| Descrizione fisica | 1 online resource (142 pages) |
| Disciplina | 511.5 |
| Soggetto topico |
Traveling salesman problem
Vehicle routing problem |
| ISBN | 953-51-6401-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910137657803321 |
| Rijeka, Croatia : , : InTech, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
