The following pages link to The Swapping Problem on a Line (Q4268883):
Displaying 13 items.
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676) (← links)
- Heuristics for the mixed swapping problem (Q733528) (← links)
- Polynomially solvable cases of the bipartite traveling salesman problem (Q1752819) (← links)
- The uncapacitated swapping problem on a line and on a circle (Q1941377) (← 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)
- 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)
- Pallet location and job scheduling in a twin-robot system (Q2676351) (← links)
- A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
- The preemptive swapping problem on a tree (Q3100688) (← links)
- A branch‐and‐cut algorithm for the nonpreemptive swapping problem (Q5187945) (← links)
