Pages that link to "Item:Q948965"

The following pages link to An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965):

Displaying 25 items.

• An integer optimality condition for column generation on zero-one linear programs (Q2419361) (← links)
• Solving the electricity production planning problem by a column generation based heuristic (Q2434329) (← links)
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis (Q2629640) (← links)
• A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
• An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems (Q2669681) (← links)
• A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← links)
• (Q2787279) (← links)
• Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem (Q2820103) (← links)
• New route relaxation and pricing strategies for the vehicle routing problem (Q2879522) (← links)
• An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem (Q2967616) (← links)
• Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362) (← links)
• Cooperative receding horizon strategies for the multivehicle routing problem (Q4563360) (← links)
• A set‐partitioning‐based exact algorithm for the vehicle routing problem (Q4732297) (← links)
• Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
• Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization (Q5086000) (← links)
• A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations (Q5144771) (← links)
• A set covering based matheuristic for a real‐world city logistics problem (Q5246831) (← links)
• Column elimination for capacitated vehicle routing problems (Q6057244) (← links)
• Estimating the marginal cost to deliver to individual customers (Q6088526) (← links)
• Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems (Q6095737) (← links)
• The two-echelon stochastic multi-period capacitated location-routing problem (Q6106489) (← links)
• Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows (Q6160235) (← links)
• A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)