Pages that link to "Item:Q2664423"

The following pages link to Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423):

Displaying 3 items.

• The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
• The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem (Q6164609) (← links)
• Node based compact formulations for the Hamiltonian <i>p</i>‐median problem (Q6180025) (← links)