Pages that link to "Item:Q6488350"
From MaRDI portal
The following pages link to Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem (Q6488350):
Displaying 6 items.
- PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem (Q2679785) (← links)
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM (Q3991641) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
- Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms (Q6588151) (← links)