Pages that link to "Item:Q3564362"

The following pages link to Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362):

Displaying 23 items.

• A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
• The capacitated general windy routing problem with turn penalties (Q433125) (← links)
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
• An ILP improvement procedure for the open vehicle routing problem (Q991364) (← 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)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
• The demand weighted vehicle routing problem (Q1754023) (← links)
• A hybrid algorithm for the heterogeneous fleet vehicle routing problem (Q1926856) (← links)
• The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
• An exact column-generation approach for the lot-type design problem (Q1979196) (← links)
• Combined maintenance and routing optimization for large-scale sewage cleaning (Q2178360) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← links)
• Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams (Q2806865) (← links)
• Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem (Q2820103) (← links)
• Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem (Q4596148) (← links)
• Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem (Q4995084) (← links)
• The Vehicle Routing Problem with Release and Due Dates (Q5131700) (← links)