Pages that link to "Item:Q2688881"

The following pages link to A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881):

Displaying 10 items.

• A two-phase metaheuristic for the cumulative capacitated vehicle routing problem (Q340275) (← links)
• A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
• Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem (Q1762031) (← links)
• A branch-and-price-and-check model for the vehicle routing problem with location congestion (Q2398439) (← links)
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands (Q2467454) (← links)
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← links)
• Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem (Q2806992) (← links)
• A branch-and-price algorithm for capacitated arc routing problem with flexible time windows (Q2883579) (← links)
• A price-directed decomposition approach for solving large-scale capacitated part-routing problems (Q3163241) (← links)