OpenAlex
PricingAboutJobs
Log inGet started
Work

Chapter 4 The traveling salesman problem

HTML

Year: 1995
Type: book-chapter
Source: Handbooks in operations research and management science
DOI: 10.1016/s0927-0507(05)80121-5
Authors: Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi
Institutions: University of Cologne, Heidelberg University, Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti
Language: English

Topic: Vehicle Routing Optimization Methods
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Keywords: traveling salesman problem, combinatorial optimization, NP-hardness, branch and bound, Lagrangian relaxation, Lin-Kernighan heuristic, simulated annealing, polyhedral combinatorics, metric TSP, heuristic algorithms, solution quality

Open Access status: closed
OpenAlex ID: W1596059437
FWCI: 13.63
Cites: 171
Cited by: 429
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security