Similar Search Results

Branch-and-price algorithm for the Resilient Multi-level Hop-constrained Network Design

Souza, Fernanda S. H.; Gendreau, Michel; Mateus, Geraldo R. - In: European journal of operational research : EJOR 233 (2014) 1, pp. 84-93

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

Branch-and-cut algorithms for the p-arborescence star problem

Pereira, Armando Honorio; Mateus, Geraldo R.; Urrutia, … - In: International transactions in operational research : a … 29 (2022) 4, pp. 2374-2400

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

Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

Pereira, Armando Honorio; Mateus, Geraldo R.; Urrutia, … - In: European journal of operational research : EJOR 300 (2022) 1, pp. 207-220

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

Branch-and-price algorithm for the Resilient Multi-level Hop-constrained Network Design

Souza, Fernanda S.H.; Gendreau, Michel; Mateus, Geraldo R. - In: European Journal of Operational Research 233 (2014) 1, pp. 84-93

In this work, we investigate the Resilient Multi-level Hop-constrained Network Design (RMHND) problem, which consists of designing hierarchical telecommunication networks, assuring resilience against random failures and maximum delay guarantees in the communication. Three mathematical...

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