Pages that link to "Item:Q1881569"

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

Displaying 50 items.

• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy (Q1991276) (← links)
• Minimum makespan vehicle routing problem with compatibility constraints (Q2011596) (← links)
• New symmetry-less ILP formulation for the classical one dimensional bin-packing problem (Q2019488) (← links)
• The two-echelon production-routing problem (Q2028880) (← links)
• A personalized walking bus service requiring optimized route decisions: a real case (Q2029258) (← links)
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation (Q2029903) (← links)
• Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
• Heuristic optimization for multi-depot vehicle routing problem in ATM network model (Q2087124) (← links)
• Opportunities for reinforcement learning in stochastic dynamic vehicle routing (Q2108171) (← links)
• A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints (Q2140338) (← links)
• Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168) (← links)
• Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
• \(K\)-adaptability in two-stage mixed-integer robust optimization (Q2195680) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← links)
• The inventory routing problem with demand moves (Q2226502) (← links)
• A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies (Q2226503) (← links)
• The pyramidal capacitated vehicle routing problem (Q2270294) (← links)
• A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
• Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (Q2286968) (← links)
• A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries (Q2294528) (← links)
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (Q2339816) (← links)
• A compact transformation of arc routing problems into node routing problems (Q2341211) (← links)
• Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach (Q2356026) (← links)
• A unified exact method for solving different classes of vehicle routing problems (Q2390996) (← links)
• Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
• A new mixed integer linear model for a rich vehicle routing problem with docking constraints (Q2430607) (← links)
• Reachability cuts for the vehicle routing problem with time windows (Q2432846) (← links)
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
• An optimization algorithm for the inventory routing problem with continuous moves (Q2468483) (← links)
• Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
• Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341) (← links)
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← links)
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736) (← links)
• Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) (← links)
• Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
• Projection results for vehicle routing (Q2583125) (← links)
• A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← links)
• A symmetry-free polynomial formulation of the capacitated vehicle routing problem (Q2664007) (← links)
• The two-echelon inventory-routing problem with fleet management (Q2664298) (← links)
• The joint network vehicle routing game with optional customers (Q2668799) (← links)
• An improved formulation for the inventory routing problem with time-varying demands (Q2672144) (← links)
• Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← links)
• Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem (Q2820103) (← links)
• New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem (Q2883630) (← links)
• A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
• An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem (Q2967616) (← links)
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems (Q2967617) (← links)