Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems

The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs and unoriented edges: feasible solutions must traverse all the arcs. Approximation algorithms are known to provide a xed worst-case bound if the triangle inequality holds. We consider the worst-case performance of approximation algorithms for the SCP when the triangle inequality can be violated (General SCP) and for a similar problem formulated on a complete digraph (Asymmetric SCP). The research was partially done while the rst author was at Eindhoven University of Technology, supported by the Human Capital and Mobility Program of the European Community. The second author was partially supported by research contracts MURST 40% and 60% of the Italian Ministry of University and Scienti c Research. 1 

• Type: Journal
• Year: 1999
• Where: DAM
• Authors: Giovanni Righini, Marco Trubian
• Keywords: Approximation Algorithms, DAM 1999, Isa Sequencing Problem, Triangle Inequality