Pages that link to "Item:Q602676"

The following pages link to A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676):

Displaying 9 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)
• Feasibility recovery for the unit-capacity constrained permutation problem (Q1751174) (← links)
• The unit-capacity constrained permutation problem (Q1754340) (← links)
• On the transformation of lexicographic nonlinear multiobjective programs to single objective programs (Q1935897) (← links)
• A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
• Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics (Q2672119) (← links)
• The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
• Vehicle routing problems with multiple commodities: a survey (Q6572828) (← links)