Pages that link to "Item:Q2492675"

The following pages link to Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675):

Displaying 50 items.

• The close-open mixed vehicle routing problem (Q1926744) (← links)
• Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
• A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
• Minimum makespan vehicle routing problem with compatibility constraints (Q2011596) (← links)
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2031089) (← links)
• Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
• New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• Adapting the \textit{ng}-path relaxation for bike balancing problems (Q2157885) (← links)
• The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
• Combined maintenance and routing optimization for large-scale sewage cleaning (Q2178360) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
• The pyramidal capacitated vehicle routing problem (Q2270294) (← links)
• Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange (Q2289919) (← 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)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
• Petroleum supply planning: reformulations and a novel decomposition algorithm (Q2358145) (← links)
• A memetic algorithm with dynamic population management for an integrated production-distribution problem (Q2378412) (← 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)
• Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
• Solving elementary shortest-path problems as mixed-integer programs (Q2454365) (← links)
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← 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)
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis (Q2629640) (← links)
• A symmetry-free polynomial formulation of the capacitated vehicle routing problem (Q2664007) (← links)
• A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection (Q2664333) (← links)
• Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
• In-depth analysis of granular local search for capacitated vehicle routing (Q2686133) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← links)
• Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← 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)
• A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem (Q2840522) (← links)
• A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints (Q2893344) (← links)
• An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem (Q2967616) (← links)
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem (Q3057116) (← links)
• Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs (Q3057117) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• Exact Algorithms for the Chance-Constrained Vehicle Routing Problem (Q3186494) (← links)
• Last-Mile Shared Delivery: A Discrete Sequential Packing Approach (Q3387932) (← links)
• Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
• Column Generation Algorithms for the Capacitated m-Ring-Star Problem (Q3511375) (← links)