Pages that link to "Item:Q2357926"
From MaRDI portal
The following pages link to An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot (Q2357926):
Displaying 8 items.
- Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete (Q967292) (← links)
- On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands (Q1013973) (← links)
- An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem (Q1661892) (← links)
- Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case (Q2005780) (← links)
- Efficient insertion heuristic algorithms for multi-trip inventory routing problem with time windows, shift time limits and variable delivery time (Q2005829) (← links)
- A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245) (← links)
- A model of Green acceptance and intentions to use bike-sharing: YouBike users in Taiwan (Q2358052) (← links)
- Branch-and-bound-based local search heuristics for train timetabling on single-track railway network (Q2358095) (← links)
