The following pages link to (Q2728857):
Displaying 45 items.
- Optimal deterministic algorithms for some variants of online quota traveling salesman problem (Q296870) (← links)
- Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
- Online \(k\)-server routing problems (Q839628) (← links)
- A hard dial-a-ride problem that is easy on average (Q880497) (← links)
- The on-line asymmetric traveling salesman problem (Q935844) (← links)
- On the power of lookahead in on-line server routing problems (Q959800) (← links)
- The online prize-collecting traveling salesman problem (Q963439) (← links)
- New lower bounds for online \(k\)-server routing problems (Q987824) (← links)
- Dynamic pickup and delivery problems (Q1038370) (← links)
- The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail (Q1691943) (← links)
- Typology and literature review for dial-a-ride problems (Q1698288) (← links)
- From theory to practice: maximizing revenues for on-line dial-a-ride (Q1702834) (← links)
- Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system (Q1751731) (← links)
- Algorithms for on-line order batching in an order picking warehouse (Q1761193) (← links)
- Two short notes on the on-line travelling salesman: handling times and lookahead. (Q1853561) (← links)
- Improved bounds for revenue maximization in time-limited online dial-a-ride (Q1981946) (← links)
- The online food delivery problem on stars (Q2079861) (← links)
- Tight competitive analyses of online car-sharing problems (Q2089695) (← links)
- An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones (Q2273650) (← links)
- The covering Canadian traveller problem (Q2440168) (← links)
- Computational bounds for elevator control policies by large scale linear programming (Q2441574) (← links)
- Competitive analysis of a dispatch policy for a dynamic multi-period routing problem (Q2467440) (← links)
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models (Q2500540) (← links)
- How to whack moles (Q2503357) (← links)
- Improved bounds for open online dial-a-ride on the line (Q2701389) (← links)
- Maximizing Revenues for On-Line Dial-a-Ride (Q2942425) (← links)
- Online traveling salesman problems with service flexibility (Q3100693) (← links)
- The Post-Disaster Debris Clearance Problem Under Incomplete Information (Q3195231) (← links)
- Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line (Q3300763) (← links)
- Online Vehicle Routing Problems: A Survey (Q3564358) (← links)
- Discrete online TSP (Q3638442) (← links)
- New Bounds for Maximizing Revenue in Online Dial-a-Ride (Q5041189) (← links)
- (Q5090461) (← links)
- Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. (Q5091058) (← links)
- Fleet management for autonomous vehicles: Online PDP under special constraints (Q5242278) (← links)
- Stability with Uniform Bounds for On-line Dial-a-Ride Problems under Reasonable Load (Q5259019) (← links)
- New policies for the dynamic traveling salesman problem (Q5426977) (← links)
- (Q5875473) (← links)
- Car-sharing between two locations: online scheduling with flexible advance bookings (Q5896897) (← links)
- Fleet management for autonomous vehicles using flows in time-expanded networks (Q5918172) (← links)
- Euler is standing in line dial-a-ride problems with precedence-constraints (Q5948963) (← links)
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
- An improved algorithm for open online dial-a-ride (Q6176557) (← links)
- Maximizing the number of rides served for time-limited Dial-a-Ride* (Q6661115) (← links)
