Improved Approximations for TSP with Simple Precedence Constraints.

Hans-Joachim Böckenhauer Ralf Klasing Tobias Mömke Monika Steinová

Published in: CIAC (2010)

Keyphrases

precedence constraints
scheduling problem
branch and bound algorithm
traveling salesman problem
setup times
search space
genetic algorithm
np hard
tabu search
parallel machines
partially ordered
parallel processors
sequence dependent setup times
precedence relations
partially ordered sets