Pages that link to "Item:Q1886846"

The following pages link to A compact model and tight bounds for a combined location-routing problem (Q1886846):

Displaying 39 items.

• A new formulation approach for location-routing problems (Q264241) (← links)
• A survey of recent research on location-routing problems (Q296678) (← links)
• The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← links)
• A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
• A solution method for a two-layer sustainable supply chain distribution model (Q337368) (← 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)
• Variable neighborhood search for location routing (Q339539) (← links)
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem (Q339543) (← links)
• Solution method for the location planning problem of logistics park with variable capacity (Q339598) (← links)
• A hybrid evolutionary algorithm for the periodic location-routing problem (Q531435) (← links)
• A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) (← links)
• A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery (Q713116) (← links)
• Location-routing: issues, models and methods (Q856260) (← links)
• Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia (Q857313) (← links)
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (Q862819) (← links)
• A dynamic logistics coordination model for evacuation and support in disaster response activities (Q864038) (← links)
• A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem (Q954046) (← links)
• The capacity and distance constrained plant location problem (Q954059) (← links)
• Combined location-routing problems -- a neural network approach (Q1026597) (← links)
• An endosymbiotic evolutionary algorithm for the hub location-routing problem (Q1665926) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• Location routing problems on trees (Q1735670) (← links)
• Solving a bi-objective transportation location routing problem by metaheuristic algorithms (Q2256166) (← links)
• Distribution systems design with two-level routing considerations (Q2267311) (← links)
• A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study (Q2404310) (← links)
• A location-routing problem for the conversion to the ``click-and-mortar'' retailing: the static case (Q2462150) (← links)
• A particle swarm optimization algorithm with path relinking for the location routing problem (Q2481605) (← links)
• A metaheuristic to solve a location-routing problem with nonlinear costs (Q2491322) (← links)
• Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery (Q2514738) (← links)
• A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
• Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423) (← links)
• A new approach on auxiliary vehicle assignment in capacitated location routing problem (Q2795191) (← links)
• A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
• Distribution network design on the battlefield (Q3168957) (← links)
• A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem (Q6065616) (← links)
• The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
• New path elimination constraints for multi-depot routing problems (Q6496355) (← links)