Detecting and preventing routing problems in the planning process of CCSS\#7 networks

DOI10.1023/A:1009674028763zbMath1064.90585MaRDI QIDQ556723

Gustavo Paramés, Gonzalo Carrión, Javier Calatrava

Publication date: 22 June 2005

Published in: Journal of Heuristics (Search for Journal in Brave)

zbMATH Keywords

dynamic programminggenetic algorithmsloopsheuristictravelling salesman problemnetwork planningsignalling

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (1)

On the enrouting protocol problem under uncertainty

This page was built for publication: Detecting and preventing routing problems in the planning process of CCSS\#7 networks