Tabu search approach for the bi-level competitive base station location problem

DOI10.1007/978-3-319-44914-2_29MaRDI QIDQ3133228zbMATH OpenOpenAlexFDO

Authors I. Davydov, Marceau Coupechoux, Stefano Iellamo

Publication date 13 February 2018

Published in Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44914-2_29

zbMATH Keywords

bilevel programmingcompetitive locationtabu search

Mathematics Subject Classification ID

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

Recommendations

• Tabu Search Heuristic for Competitive Base Station Location Problem
• Competitive location in cognitive radio networks
• scientific article; zbMATH DE number 6006831
• Approximate algorithms for the competitive facility location problem
• Bilevel competitive facility location and pricing problems

Cited in

(3)

• A kernel search matheuristic to solve the discrete leader-follower location problem
• Competitive location in cognitive radio networks
• Tabu Search Heuristic for Competitive Base Station Location Problem

This page was built for publication: Tabu search approach for the bi-level competitive base station location problem

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