Pages that link to "Item:Q622138"

The following pages link to A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138):

Displaying 50 items.

• A new formulation approach for location-routing problems (Q264241) (← links)
• A survey of recent research on location-routing problems (Q296678) (← links)
• Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm (Q296782) (← links)
• Sequential and parallel large neighborhood search algorithms for the periodic location routing problem (Q319012) (← links)
• A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
• A survey on two-echelon routing problems (Q337424) (← links)
• A memetic algorithm for the capacitated location-routing problem with mixed backhauls (Q337427) (← links)
• Battery swap station location-routing problem with capacitated electric vehicles (Q337428) (← 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)
• Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
• Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking (Q421715) (← links)
• Multiperiod location-routing with decoupled time scales (Q439365) (← links)
• Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
• A hybrid evolutionary algorithm for the periodic location-routing problem (Q531435) (← links)
• A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery (Q713116) (← links)
• A new bi-objective location-routing problem for distribution of perishable products: evolutionary computation approach (Q894544) (← links)
• Solving the capacitated location-routing problem. Abstract of Thesis (Q926566) (← links)
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← links)
• Solving the bus evacuation problem and its variants (Q1651627) (← links)
• A simple and effective evolutionary algorithm for the capacitated location-routing problem (Q1651634) (← links)
• Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm (Q1652448) (← links)
• A column generation approach for the location-routing problem with time windows (Q1652527) (← links)
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• Optimization of a two-echelon location lot-sizing routing problem with deterministic demand (Q1720647) (← links)
• A location-inventory-routing problem in forward and reverse logistics network design (Q1727487) (← links)
• Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472) (← links)
• Location routing problems on trees (Q1735670) (← links)
• Column generation based approaches for combined routing and scheduling (Q1742215) (← links)
• A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← 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)
• The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
• A location-or-routing problem with partial and decaying coverage (Q2108134) (← links)
• A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem (Q2198264) (← links)
• The location routing problem using electric vehicles with constrained distance (Q2289942) (← 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)
• Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands (Q2355806) (← links)
• A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study (Q2404310) (← links)
• Combined location and routing problems for drug distribution (Q2448896) (← 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)
• Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423) (← links)
• The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach (Q2668681) (← links)