Competitive location in cognitive radio networks

DOI10.1007/S10288-014-0268-1MaRDI QIDQ2342922zbMATH OpenOpenAlexFDO

Authors Stefano Iellamo, Ekaterina Alekseeva, Lin Chen, Marceau Coupechoux, Yury Kochetov

Publication date 29 April 2015

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://hal-imt.archives-ouvertes.fr/hal-01144293/file/versionl1.pdf

zbMATH Keywords

bi-level programmingcognitive radio networkscompetitive locationleader-follower gamemetaheuristics

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Tabu search approach for the bi-level competitive base station location problem
• Tabu Search Heuristic for Competitive Base Station Location Problem
• Entry, competition, and regulation in cognitive radio scenarios: a simple game theory model
• Inter-operator spectrum sharing from a game theoretical perspective
• Network sharing by two mobile operators: beyond competition, cooperation

Cites work

• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
• Competitive facility location models
• Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
• Facility location: discrete models and local search methods
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• New Branch-and-Bound Rules for Linear Bilevel Programming
• On the Complexity of Some Common Geometric Location Problems
• On the complexity of the \((r|p)\)-centroid problem in the plane
• Sequential competitive location on networks

Cited in

(7)

• Radio communications interdiction problem under deterministic and probabilistic jamming
• Tabu search approach for the bi-level competitive base station location problem
• Spatial False Alarm in Cognitive Radio Network
• A local search algorithm for the single machine scheduling problem with setups and a storage
• A bilevel competitive location and pricing model with nonuniform split of demand
• The branch and cut method for the clique partitioning problem
• A leader-follower single allocation hub location problem under fixed markups

Describes a project that uses

Uses Software

• CPLEX
• Tabu search

This page was built for publication: Competitive location in cognitive radio networks

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