Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
Some applications of the clustered travelling salesman problem
G. Laporte, U. Palekar
National Center for Supercomputing Applications (NCSA)
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Some applications of the clustered travelling salesman problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Clustered Traveling Salesman Problem
100%
Computer Program
50%
Modeling Tools
50%
Research Application
50%
Execution Time
50%
Operations Research
50%
Computer Operations
50%
Vehicle Routing
50%
Integrated Circuit Testing
50%
Examination Timetabling
50%
Operation Examination
50%
Computer Science
Traveling Salesman Problem
100%
Integrated Circuits
50%
Computer Software
50%
Execution Time
50%
System Analysis
50%
Vehicle Routing
50%
Computer Manufacturing
50%
Mathematics
Traveling Salesman Problem
100%
Execution Time
50%
Modeling Tool
50%
Operations Research
50%
Material Science
Electronic Circuit
100%