Pages that link to "Item:Q2879523"
From MaRDI portal
The following pages link to An Exact Method for the Capacitated Location-Routing Problem (Q2879523):
Displayed 32 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 distribution network design problem in the automotive industry: MIP formulation and heuristics (Q337173) (← 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)
- 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)
- 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)
- Optimization of a two-echelon location lot-sizing routing problem with deterministic demand (Q1720647) (← links)
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
- A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← 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)
- 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)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← 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)
- 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)
- A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
- Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery (Q2658463) (← links)
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem (Q2967616) (← links)
- The location routing problem with facility sizing decisions (Q6056170) (← 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)
- Electric vehicles fast charger location-routing problem under ambient temperature (Q6115621) (← links)