Pages that link to "Item:Q4294336"
From MaRDI portal
The following pages link to Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming (Q4294336):
Displayed 6 items.
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← links)
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
- The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The travelling salesman problem with precedence constraints. (Q2467824) (← links)
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)