Pages that link to "Item:Q3564358"
From MaRDI portal
The following pages link to Online Vehicle Routing Problems: A Survey (Q3564358):
Displaying 19 items.
- Dynamic pickup and delivery problems (Q1038370) (← links)
- The Steiner traveling salesman problem with online advanced edge blockages (Q1651622) (← links)
- From theory to practice: maximizing revenues for on-line dial-a-ride (Q1702834) (← links)
- Online graph exploration: New results on old and new algorithms (Q1929219) (← links)
- Improved bounds for revenue maximization in time-limited online dial-a-ride (Q1981946) (← links)
- Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
- Online routing and searching on graphs with blocked edges (Q2165266) (← links)
- Optimal online and offline algorithms for robot-assisted restoration of barrier coverage (Q2197483) (← links)
- Weighted online minimum latency problem with edge uncertainty (Q2239843) (← links)
- Pricing and allocation algorithm designs in dynamic ridesharing system (Q2283011) (← links)
- The covering Canadian traveller problem (Q2440168) (← links)
- An online optimization approach for post-disaster relief distribution with online blocked edges (Q2669638) (← links)
- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage (Q3453288) (← links)
- New Bounds for Maximizing Revenue in Online Dial-a-Ride (Q5041189) (← links)
- Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery (Q6047877) (← links)
- Heuristic algorithms based on column generation for an online product shipping problem (Q6065593) (← links)
- Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands (Q6070975) (← links)
- Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures (Q6109290) (← links)
- Maximizing the number of rides served for time-limited Dial-a-Ride* (Q6661115) (← links)
