Pages that link to "Item:Q1339118"

The following pages link to A branch-and-cut algorithm for vehicle routing problems (Q1339118):

Displaying 35 items.

• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities (Q510949) (← links)
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
• Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
• A global MILP model for FMS scheduling (Q1278123) (← links)
• Separating capacity constraints in the CVRP using tabu search (Q1609917) (← links)
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
• An exact algorithm for a vehicle-and-driver scheduling problem (Q1652246) (← links)
• Limited memory rank-1 cuts for vehicle routing problems (Q1728212) (← links)
• Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472) (← links)
• Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
• New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
• Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
• A new branch-and-cut algorithm for the capacitated vehicle routing problem (Q1881569) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• An efficient transformation of the generalized vehicle routing problem (Q1971986) (← links)
• A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
• Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach (Q2356026) (← links)
• New mathematical models of the generalized vehicle routing problem and extensions (Q2428862) (← links)
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
• The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands (Q2664291) (← links)
• Solving a truck dispatching scheduling problem using branch-and-cut (Q2781096) (← links)
• 2-path cuts for the vehicle routing problem with time windows (Q2783836) (← links)
• Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments (Q2811328) (← links)
• Solution of a min-max vehicle routing problem (Q2884530) (← links)
• Maximally violated mod-\(p\) cuts for the capacitated vehicle-routing problem (Q2892303) (← links)
• Two exact algorithms for the distance-constrained vehicle routing problem (Q3325496) (← links)
• A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem (Q3391966) (← links)
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (Q3392004) (← links)
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362) (← links)
• (Q3690603) (← links)
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows (Q4408696) (← links)
• Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size (Q4979994) (← links)
• Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
• Branch and cut methods for network optimization (Q5936762) (← links)