Pages that link to "Item:Q319445"

The following pages link to Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445):

Displaying 21 items.

• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
• The flexible periodic vehicle routing problem (Q1652351) (← links)
• The shared customer collaboration vehicle routing problem (Q1681166) (← links)
• A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
• The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
• On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
• The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
• Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← links)
• A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
• Comparison of formulations for the inventory routing problem (Q2160484) (← links)
• The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
• Mixed integer formulations for a routing problem with information collection in wireless networks (Q2273919) (← links)
• Multi-depot rural postman problems (Q2408522) (← links)
• A symmetry-free polynomial formulation of the capacitated vehicle routing problem (Q2664007) (← links)
• Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
• Preprocessing to reduce vehicle capacity for routing problems (Q6097441) (← links)
• Designing a multi-modal and variable-echelon delivery system for last-mile logistics (Q6109810) (← links)
• Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups (Q6113320) (← links)