A variable neighborhood search for the network design problem with relays
From MaRDI portal
Publication:2403270
DOI10.1007/s10732-017-9332-2zbMath1370.90302OpenAlexW2609708508MaRDI QIDQ2403270
Publication date: 8 September 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-017-9332-2
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Minimum cost path problems with relays
- The network design problem with relays
- Optimization of capacity expansion planning for gas transportation networks
- Depth-first search is inherently sequential
- Variable neighborhood search
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- The regenerator location problem
- The Generalized Regenerator Location Problem
- Variable neighborhood search for the p-median
This page was built for publication: A variable neighborhood search for the network design problem with relays