Optimal Planning for Timed Partial Order Specifications: A Generalized Traveling Salesman Problem Approach

The authors propose a planning framework that translates the problem of planning under Timed Partial Order (TPO) specifications into a Generalized Traveling Salesman Problem (GTSP) with timing and precedence constraints, which they solve using a Mixed Integer Linear Programming (MILP) formulation.