An adaptive variable neighborhood search for solving the multi-objective node placement problem
From MaRDI portal
Publication:2631257
DOI10.1016/j.endm.2014.11.025zbMath1362.90120OpenAlexW2081493274MaRDI QIDQ2631257
Ons Abdelkhalek, Hela Masri, Saoussen Krichen
Publication date: 29 July 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2014.11.025
Multi-objective and goal programming (90C29) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (4)
Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem ⋮ A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint ⋮ Variable neighborhood search: the power of change and simplicity ⋮ Deployment optimization of multi-hop wireless networks based on substitution graph
This page was built for publication: An adaptive variable neighborhood search for solving the multi-objective node placement problem