Pages that link to "Item:Q1984690"

The following pages link to Branch-and-bound for the precedence constrained generalized traveling salesman problem (Q1984690):

Displayed 3 items.

• Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints (Q5040957) ‎ (← links)
• Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) ‎ (← links)
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) ‎ (← links)