Pages that link to "Item:Q6112583"
From MaRDI portal
The following pages link to Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583):
Displayed 3 items.
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) (← links)
- Comparison and polyhedral properties of valid inequalities for a polytope of schedules for servicing identical requests (Q6194920) (← links)