The following pages link to The swapping problem (Q4018998):
Displayed 14 items.
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676) (← links)
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (Q705506) (← links)
- Heuristics for the mixed swapping problem (Q733528) (← links)
- Dynamic pickup and delivery problems (Q1038370) (← links)
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
- Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
- Solving the shortest route cut and fill problem using simulated annealing (Q1869428) (← links)
- Approximation algorithms for the Euclidean bipartite TSP (Q2488237) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- Balancing the stations of a self service “bike hire” system (Q3016180) (← links)
- One-to-Many-to-One Single Vehicle Pickup and Delivery Problems (Q3564364) (← links)
- (Q4700651) (← links)
- A branch‐and‐cut algorithm for the nonpreemptive swapping problem (Q5187945) (← links)
- The vehicle routing problem with pickups and deliveries on some special graphs (Q5957355) (← links)