Pages that link to "Item:Q1609917"

The following pages link to Separating capacity constraints in the CVRP using tabu search (Q1609917):

Displaying 38 items.

• On service consistency in multi-period vehicle routing (Q319190) (← links)
• The \(k\)-dissimilar vehicle routing problem (Q319301) (← links)
• Disrupted capacitated vehicle routing problem with order release delay (Q367646) (← links)
• A min-max vehicle routing problem with split delivery and heterogeneous demand (Q376008) (← links)
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
• A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) (← links)
• Recent advances in vehicle routing exact algorithms (Q926561) (← links)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
• Vehicle routing with stochastic time-dependent travel times (Q976985) (← links)
• The school bus routing problem: a review (Q1039772) (← links)
• Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
• Separating capacity constraints in the CVRP using tabu search (Q1609917) (← links)
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
• The static bike relocation problem with multiple vehicles and visits (Q1681499) (← links)
• The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
• On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)
• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
• Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
• Self-imposed time windows in vehicle routing problems (Q2018105) (← links)
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation (Q2029903) (← links)
• Time window optimization for attended home service delivery under multiple sources of uncertainties (Q2108142) (← links)
• Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach (Q2356026) (← links)
• A queueing framework for routing problems with time-dependent travel times (Q2369970) (← links)
• Vehicle routing with dynamic travel times: a queueing approach (Q2426527) (← links)
• Bike sharing systems: solving the static rebalancing problem (Q2445841) (← links)
• Arc routing in a node routing environment (Q2571193) (← links)
• Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
• Balancing the stations of a self service “bike hire” system (Q3016180) (← links)
• An Approximation-Based Approach for Chance-Constrained Vehicle Routing and Air Traffic Control Problems (Q3296386) (← links)
• Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times (Q4994167) (← links)
• The Distributionally Robust Chance-Constrained Vehicle Routing Problem (Q5130504) (← links)
• Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
• Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem (Q5963105) (← links)
• On the shortest path problem with negative cost cycles (Q5963684) (← links)
• Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture (Q6066680) (← links)
• Estimating the marginal cost to deliver to individual customers (Q6088526) (← links)
• Routing and scheduling of platform supply vessels in offshore oil and gas logistics (Q6551169) (← links)