Tabu Search Heuristic for Competitive Base Station Location Problem

DOI10.1007/978-3-319-42902-1_44MaRDI QIDQ4596234zbMATH OpenOpenAlexFDO

Authors Marceau Coupechoux, I. Davydov, Stefano Iellamo

Publication date 1 December 2017

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-42902-1_44

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Tabu search approach for the bi-level competitive base station location problem
• scientific article; zbMATH DE number 2209653
• scientific article; zbMATH DE number 2089212
• Tabu search for large location–allocation problems
• Local search heuristics for the mobile facility location problem
• Tabu search for frequency assignment in mobile radio networks
• A tabu search approach to the uncapacitated facility location problem
• scientific article; zbMATH DE number 2114492

Cited in

(4)

• The location-allocation problem of drone base stations
• Competitive location in cognitive radio networks
• Tabu search approach for the bi-level competitive base station location problem
• Buffer dimensioning and control stations positioning with a space partitioning-tabu search approach

This page was built for publication: Tabu Search Heuristic for Competitive Base Station Location Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596234)