Tabu Search Approach for the Bi-Level Competitive Base Station Location Problem

DOI10.1007/978-3-319-44914-2_29zbMath1385.90014OpenAlexW2558400551MaRDI QIDQ3133228

Marceau Coupechoux, Ivan Davydov, 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

tabu searchbilevel programmingcompetitive location

Mathematics Subject Classification ID

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

Related Items (1)

A kernel search matheuristic to solve the discrete leader-follower location problem

This page was built for publication: Tabu Search Approach for the Bi-Level Competitive Base Station Location Problem