Pages that link to "Item:Q951110"

The following pages link to Combined route capacity and route length models for unit demand vehicle routing problems (Q951110):

Displaying 11 items.

• Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
• Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← 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)
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
• Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems (Q2294623) (← links)
• (Q2861531) (← links)
• Further contributions to network optimization (Q5487817) (← links)
• Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)