Pages that link to "Item:Q341462"
From MaRDI portal
The following pages link to Finding optimal tour schedules on transportation paths under extended time window constraints (Q341462):
Displaying 9 items.
- Solving the traveling repairman problem on a line with general processing times and deadlines (Q319440) (← links)
- Using Benders decomposition to implicitly model tour scheduling (Q596429) (← links)
- Survey, categorization, and comparison of recent tour scheduling literature (Q1888180) (← links)
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios (Q2294628) (← links)
- Scenario analysis-based decision and coordination in supply chain management with production and transportation scheduling (Q2310974) (← links)
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios (Q2329723) (← links)
- Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling (Q3114668) (← links)
- Solving Large-Scale Tour Scheduling Problems (Q4320779) (← links)
- Vehicle routing for connected service areas -- a versatile approach covering single, hierarchical, and bi-criteria objectives (Q6555172) (← links)
