The flexible and real-time commute trip sharing problems
From MaRDI portal
Publication:823767
Recommendations
Cites work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- A reoptimization algorithm for the shortest path problem with time windows
- Efficient feasibility testing for dial-a-ride problems
- Last-mile scheduling under uncertainty
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- The pickup and delivery problem with time windows
Cited in
(3)
This page was built for publication: The flexible and real-time commute trip sharing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q823767)