Approximation algorithms for sequencing problems

Authors:
R. Ravi;Viswanath Nagarajan
Affiliations:
Carnegie Mellon University;Carnegie Mellon University
Venue:
Approximation algorithms for sequencing problems
Year:
2009

Citing 0
Cited 3

Approximation algorithms for optimal decision trees and adaptive TSP problems

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Facility location with client latencies: linear programming based techniques for minimum latency problems

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Minimum latency submodular cover

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

This thesis presents approximation algorithms for some sequencing problems, with an emphasis on vehicle routing. Vehicle Routing Problems (VRPs) form a rich class of variants of the basic Traveling Salesman Problem, that are also practically motivated. The VRPs considered in this thesis include single and multiple vehicle Dial a Ride, VRP with Stochastic Demands, Directed Orienteering and Directed Minimum Latency. Other sequencing problems studied in this thesis are Permutation Flowshop Scheduling and Maximum Quadratic Assignment.