Similar Search Results

A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem

Domínguez-Martín, Bencomo; Hernández-Pérez, Hipólito; … - In: Computers & operations research : an international journal 161 (2024), pp. 1-16

Persistent link: https://www.econbiz.de/10014557802

Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem

Letchford, Adam N.; Salazar-González, Juan-José - In: European Journal of Operational Research 244 (2015) 3, pp. 730-738

The Capacitated Vehicle Routing Problem is a much-studied (and strongly NP-hard) combinatorial optimization problem, for which many integer programming formulations have been proposed. We present two new multi-commodity flow (MCF) formulations, and show that they dominate all of the existing...

Persistent link: https://www.econbiz.de/10011264302

A branch-and-cut algorithm for the hub location and routing problem

Rodríguez-Martín, Immaculada; Salazar-González, … - In: Computers & operations research : and their … 50 (2014), pp. 161-174

Persistent link: https://www.econbiz.de/10010400244

A branch-and-cut algorithm for two-level survivable network design problems

Rodríguez-Martín, Inmaculada; Salazar-González, … - In: Computers & operations research : and their … 67 (2016), pp. 102-112

Persistent link: https://www.econbiz.de/10011441276

An algorithmic framework for the exact solution of tree-star problems

Leitner, Markus; Ljubić, Ivana; Salazar-González, … - In: European journal of operational research : EJOR 261 (2017) 1, pp. 54-66

Persistent link: https://www.econbiz.de/10011764100

Stronger multi-commodity flow formulations of the capacitated vehicle routing problem

Letchford, Adam N.; Salazar-González, Juan-José - In: European journal of operational research : EJOR 244 (2015) 3, pp. 730-738

Persistent link: https://www.econbiz.de/10011289947

The driver and vehicle routing problem

Domínguez-Martín, Bencomo; Rodríguez-Martín, Inmaculada - In: Computers & operations research : and their … 92 (2018), pp. 56-64

Persistent link: https://www.econbiz.de/10011803802

The Capacitated Vehicle Routing Problem : stronger bounds in pseudo-polynomial time

Letchford, Adam N.; Salazar-González, Juan-José - In: European journal of operational research : EJOR 272 (2019) 1, pp. 24-31

Persistent link: https://www.econbiz.de/10011941705

A seminal contribution of Ailsa Land and Alison Doig Harcourt to the field of mathematical programming

Laporte, Gilbert - 2023

Persistent link: https://www.econbiz.de/10014458578

The time-dependent pollution-routing problem

Franceschetti, Anna; Honhon, Dorothée; Van Woensel, Tom; … - In: Transportation Research Part B: Methodological 56 (2013) C, pp. 265-293

The Time-Dependent Pollution-Routing Problem (TDPRP) consists of routing a fleet of vehicles in order to serve a set of customers and determining the speeds on each leg of the routes. The cost function includes emissions and driver costs, taking into account traffic congestion which, at peak...

Persistent link: https://www.econbiz.de/10011065511