Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines

Ann Melissa Campbell; Barrett W. Thomas

doi:10.1016/j.cor.2008.01.006

ScienceGate Book Chapters

JOURNAL ARTICLE

Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines

Ann Melissa Campbell Barrett W. Thomas

Year: 2008 Journal: Computers & Operations Research Vol: 36 (4)Pages: 1231-1248 Publisher: Elsevier BV

DOI: 10.1016/j.cor.2008.01.006

Get Full-Text PDF Get Analytical Report

Keywords:

Travelling salesman problem Probabilistic logic Computer science Computation Mathematical optimization Reduction (mathematics) Extension (predicate logic) Traveling purchaser problem Function (biology) 2-opt Algorithm Mathematics Artificial intelligence

Metrics

Cited By

8.50

FWCI (Field Weighted Citation Impact)

Refs

0.97

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Constraint Satisfaction and Optimization

Physical Sciences → Computer Science → Computer Networks and Communications

Scheduling and Timetabling Solutions

Social Sciences → Decision Sciences → Management Science and Operations Research

Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines

Metrics

Citation History

Topics

Related Documents

Probabilistic Traveling Salesman Problem with Deadlines

Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines

On the computational complexity of the Probabilistic Traveling Salesman Problem with Deadlines

An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU

Online traveling salesman problem with deadlines and service flexibility