The following pages link to The swapping problem (Q4018998):
Displayed 30 items.
- The static bicycle relocation problem with demand intervals (Q296779) (← links)
- 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)
- Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
- An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation (Q1695028) (← links)
- Feasibility recovery for the unit-capacity constrained permutation problem (Q1751174) (← links)
- Polynomially solvable cases of the bipartite traveling salesman problem (Q1752819) (← links)
- The unit-capacity constrained permutation problem (Q1754340) (← links)
- Solving the shortest route cut and fill problem using simulated annealing (Q1869428) (← links)
- Preemptive stacker crane problem: extending tree-based properties and construction heuristics (Q2030604) (← links)
- A truck scheduling problem arising in intermodal container transportation (Q2356036) (← links)
- An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot (Q2357926) (← links)
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
- Bike sharing systems: solving the static rebalancing problem (Q2445841) (← links)
- Approximation algorithms for the Euclidean bipartite TSP (Q2488237) (← links)
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- Geometric planar networks on bichromatic collinear points (Q2664940) (← links)
- Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem (Q2907956) (← links)
- A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
- Balancing the stations of a self service “bike hire” system (Q3016180) (← links)
- The preemptive swapping problem on a tree (Q3100688) (← links)
- One-to-Many-to-One Single Vehicle Pickup and Delivery Problems (Q3564364) (← links)
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries (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)