Simulated Annealing Algorithm for Optimal Relay Placement in Cellular Networks

Mattia Minelli 1, 2, 3 Maode Ma 1 Marceau Coupechoux 2, 3 Jean-Marc Kélif 4 Marc Sigelle 5
1 NTU - Nanayang Technological University
2 RMS - Réseaux, Mobilité et Services
LTCI - Laboratoire Traitement et Communication de l'Information
3 INFRES - Département Informatique et Réseaux
4 Orange Labs [Lannion]
5 LTCI - Laboratoire Traitement et Communication de l'Information
Document type :
Conference papers
Complete list of metadatas
https://hal.telecom-paristech.fr/hal-02286732
Contributor : Telecomparis Hal <>
Submitted on : Friday, September 13, 2019 - 4:06:43 PM
Last modification on : Thursday, October 17, 2019 - 12:37:02 PM

Identifiers

  • HAL Id : hal-02286732, version 1

Collections

LTCI | CNRS | PARISTECH | INSTITUT-TELECOM | INFRES | RMS

Citation

Mattia Minelli, Maode Ma, Marceau Coupechoux, Jean-Marc Kélif, Marc Sigelle. Simulated Annealing Algorithm for Optimal Relay Placement in Cellular Networks. Workshop on Algorithmic Game Theory: Learning Algorithms and Dynamics in Distributed Systems (AlgoGT), Invited poster, Jul 2013, Grenoble, France. ⟨hal-02286732⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

11

Contact

CCSD