Pages that link to "Item:Q1176821"

The following pages link to Polyhedral results for a vehicle routing problem (Q1176821):

Displaying 11 items.

• Solution algorithms for synchronous flow shop problems with two dominating machines (Q342451) (← links)
• Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
• Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
• A result on projection for the vehicle routing problem (Q1127162) (← links)
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
• Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands (Q2664291) (← links)
• (Q2861522) (← links)
• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route (Q5326796) (← links)