Pages that link to "Item:Q5187945"

The following pages link to A branch‐and‐cut algorithm for the nonpreemptive swapping problem (Q5187945):

Displaying 10 items.

• The static bicycle relocation problem with demand intervals (Q296779) (← links)
• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676) (← links)
• Heuristics for the mixed swapping problem (Q733528) (← links)
• Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system (Q829193) (← links)
• The unit-capacity constrained permutation problem (Q1754340) (← links)
• Bike sharing systems: solving the static rebalancing problem (Q2445841) (← links)
• The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
• A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
• The preemptive swapping problem on a tree (Q3100688) (← links)