Pages that link to "Item:Q3479797"
From MaRDI portal
The following pages link to Routing and Scheduling on a Shoreline with Release Times (Q3479797):
Displaying 42 items.
- Solving the traveling repairman problem on a line with general processing times and deadlines (Q319440) (← links)
- Complexity of routing problems with release dates (Q320090) (← links)
- Cyclic inventory routing in a line-shaped network (Q322426) (← links)
- Finding optimal tour schedules on transportation paths under extended time window constraints (Q341462) (← links)
- A reclaimer scheduling problem arising in coal stockyard management (Q341465) (← links)
- Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle (Q428867) (← links)
- Emergency path restoration problems (Q435733) (← links)
- How to collect balls moving in the Euclidean plane (Q860383) (← links)
- Profit-based latency problems on the line (Q943793) (← links)
- A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times (Q1007578) (← links)
- Vehicle routing problems on a line-shaped network with release time constraints (Q1015302) (← links)
- Single-vehicle scheduling with time window constraints (Q1297696) (← links)
- Ship scheduling: The last decade (Q1319526) (← links)
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. (Q1406038) (← links)
- Scheduling electric vehicles and locating charging stations on a path (Q1617297) (← links)
- The Steiner traveling salesman problem with online advanced edge blockages (Q1651622) (← links)
- Complexity of routing problems with release dates and deadlines (Q1754053) (← links)
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840) (← links)
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times (Q1884949) (← links)
- Linear time approximation schemes for vehicle scheduling problems (Q1887080) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Improved algorithms for single vehicle scheduling on tree/cycle networks (Q2051909) (← links)
- Vehicle scheduling problems with two agents on a line (Q2099389) (← links)
- Routing and scheduling problems with two agents on a line-shaped network (Q2149871) (← links)
- The single line moving target traveling salesman problem with release times (Q2158632) (← links)
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios (Q2294628) (← links)
- Approximating a vehicle scheduling problem with time windows and handling times (Q2481960) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- Two-agent vehicle scheduling problem on a line-shaped network (Q2691417) (← links)
- Single-vehicle scheduling problems with release and service times on a line (Q3082601) (← links)
- Minimizing the total weighted delivery time in container transportation scheduling (Q3120557) (← links)
- Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks (Q3150129) (← links)
- Online Vehicle Routing Problems: A Survey (Q3564358) (← links)
- Discrete online TSP (Q3638442) (← links)
- Serving requests with on-line routing (Q5056164) (← links)
- Competitive algorithms for the on-line traveling salesman (Q5057434) (← links)
- Balancing profits and costs on trees (Q5326788) (← links)
- Scheduling of waterways with tide and passing box (Q6051583) (← links)
- Single-vehicle scheduling problem on a straight line with time window constraints (Q6085761) (← links)
- On the computational complexity of the patrol boat scheduling problem with complete coverage (Q6093558) (← links)
- How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring (Q6102844) (← links)
- Vehicle routing for connected service areas -- a versatile approach covering single, hierarchical, and bi-criteria objectives (Q6555172) (← links)
