Pages that link to "Item:Q2967616"

The following pages link to An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem (Q2967616):

Displaying 43 items.

• Sequential and parallel large neighborhood search algorithms for the periodic location routing problem (Q319012) (← links)
• Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows (Q320995) (← links)
• The latency location-routing problem (Q323569) (← links)
• A memetic algorithm for the capacitated location-routing problem with mixed backhauls (Q337427) (← links)
• Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem (Q339543) (← links)
• Lower and upper bounds for the two-echelon capacitated location-routing problem (Q339668) (← links)
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics (Q339671) (← links)
• Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking (Q421715) (← links)
• A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) (← links)
• A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
• A simple and effective evolutionary algorithm for the capacitated location-routing problem (Q1651634) (← links)
• A column generation approach for the location-routing problem with time windows (Q1652527) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
• Optimization of a two-echelon location lot-sizing routing problem with deterministic demand (Q1720647) (← links)
• A column generation approach for location-routing problems with pickup and delivery (Q1991113) (← links)
• Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network (Q1991177) (← links)
• Hybrid heuristic for the optimal design of photovoltaic installations considering mismatch loss effects (Q2003424) (← links)
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2031089) (← links)
• A location-or-routing problem with partial and decaying coverage (Q2108134) (← links)
• A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem (Q2140329) (← links)
• The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches (Q2156989) (← links)
• A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system (Q2160517) (← links)
• A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (Q2339816) (← links)
• A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study (Q2404310) (← links)
• Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
• Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery (Q2514738) (← links)
• Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery (Q2658463) (← links)
• The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach (Q2668681) (← links)
• Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions (Q2676276) (← links)
• Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (Q2802246) (← links)
• An exact method for the capacitated location-routing problem (Q2879523) (← links)
• Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation (Q3115938) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
• Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem (Q4995084) (← links)
• Multi-period location routing: an application to the planning of mobile clinic operations in Iraq (Q6047833) (← links)
• Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery (Q6087621) (← links)
• The two-echelon stochastic multi-period capacitated location-routing problem (Q6106489) (← links)
• A conceptually simple algorithm for the capacitated location-routing problem (Q6491328) (← links)