|
I. F. Akyildiz
, X. Wang
and W. Wang
, Wireless mesh networks: A survey, Computer Networks, 47 (2005)
, 445-487.
|
|
C. R. Anderson
and T. S. Rappaport
, In-building wideband partition loss measurements at 2.5 and 60 GHz, IEEE Transactions on Wireless Communications, 3 (2004)
, 922-928.
|
|
F. Birlik
, Ö. Gürbüz
and Ö. Erçetin
, Iptv home networking via 802.11 wireless mesh networks: An implementation experience, IEEE Transactions on Consumer Electronics, 55 (2009)
, 1192-1199.
|
|
V. E. Brimkov
, A. Leach
, J. Wu
and M. Mastroianni
, Approximation algorithms for a geometric set cover problem, Discrete Applied Mathematics, 160 (2012)
, 1039-1052.
doi: 10.1016/j.dam.2011.11.023.
|
|
P. Cappanera, A survey on obnoxious facility location problems, Tech. Rep. TR-99-11, University of Pisa, 1999.
|
|
R. L. Carraway
and R. L. Schmidt
, An improved discrete dynamic programming algorithm for allocating resources among interdependent projects, Management Science, 37 (1991)
, 1195-1200.
doi: 10.1287/mnsc.37.9.1195.
|
|
F. D. Croce
, A. Grosso
and M. Locatelli
, A heuristic approach for the max-min diversity problem based on max-clique, Computers & Operations Research, 36 (2009)
, 2429-2433.
doi: 10.1016/j.cor.2008.09.007.
|
|
Z. Drezner and H. W. Hamacher,
Facility Location. Applications and Theory Berlin: Springer, 2002.
doi: 10.1007/978-3-642-56082-8.
|
|
E. Erkut
and S. Neuman
, A multiobjective model for locating undesirable facilities, Annals of Operations Research, 40 (1992)
, 209-227.
|
|
S. Fekete
and H. Meijer
, Maximum dispersion and geometric maximum weight cliques, in APPROX '00: Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization, (London, UK), Springer-Verlag, (2000)
, 132-143.
doi: 10.1007/3-540-44436-X_14.
|
|
Ö. Gürbüz
and H. Owen
, Power control based QoS provisioning for multimedia in W-CDMA, ACM Wireless Networks (WINET), 8 (2002)
, 37-44.
|
|
R. Heydari
and E. Melachrinoudis
, Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives, European Journal of Operational Research, 223 (2012)
, 452-460.
doi: 10.1016/j.ejor.2012.06.039.
|
|
P. T. Kabamba
, S. M. Meerkov
and C. Y. Tang
, Optimal, suboptimal, and adaptive threshold policies for power efficiency of wireless networks, IEEE Transactions on Information Theory, 51 (2005)
, 1359-1376.
doi: 10.1109/TIT.2005.844074.
|
|
R. L. Keeney and H. Raiffa,
Decisions with Multiple Objectives New York: John Wiley, 1976.
|
|
A. M. Khedr
and W. Osamy
, Mobility-assisted minimum connected cover in a wireless sensor network, Journal of Parallel and Distributed Computing, 72 (2012)
, 827-837.
doi: 10.1016/j.jpdc.2012.03.009.
|
|
A. H. Land
and A. G. Doig
, An automatic method of solving discrete programming problems, Econometrica, 28 (1960)
, 497-520.
doi: 10.2307/1910129.
|
|
E. Macambira
, An application of tabu search heuristic for the maximum edge-weighted subgraph problem, Annals of Operations Research, 117 (2002)
, 175-190.
doi: 10.1023/A:1021525624027.
|
|
C. Malandraki
and R. B. Dial
, A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem, European Journal of Operational, 90 (1996)
, 45-55.
|
|
R. E. Marsten
and T. L. Morin
, A hybrid approach to discrete mathematical programming, Mathematical Programming, 14 (1978)
, 21-40.
doi: 10.1007/BF01588949.
|
|
E. Melachrinoudis
and Z. Xanthopulos
, Semi-obnoxious single facility location in euclidean space, Computers, 30 (2003)
, 2191-2209.
doi: 10.1016/S0305-0548(02)00140-5.
|
|
E. Melachrinoudis
, Bicriteria location of a semi-obnoxious facility, Computers, 37 (1999)
, 581-593.
doi: 10.1016/S0360-8352(00)00022-X.
|
|
A. T. Murray
and R. L. Church
, Solving the anti-covering location problem using lagrangian relaxation, Computers, 24 (1997)
, 127-140.
doi: 10.1016/S0305-0548(96)00048-2.
|
|
Y. Ohsawa
, Bicriteria euclidean location associated with maximin and minimax criteria, Naval Research Logistics (NRL), 47 (2000)
, 581-592.
doi: 10.1002/1520-6750(200010)47:7<581::AID-NAV3>3.0.CO;2-R.
|
|
Y. Ohsawa
and K. Tamura
, Efficient location for a semi-obnoxious facility, Annals of Operations Research, 123 (2003)
, 173-188.
doi: 10.1023/A:1026127430341.
|
|
J. Rakas
, D. Teodorovic
and T. Kim
, Multi-objective modeling for determining location of undesirable facilities, Transportation Research Part D: Transport and Environment, 9 (2004)
, 125-138.
doi: 10.1016/j.trd.2003.09.002.
|
|
M. Rebai
, M. L. berre
, H. Snoussi
, F. Hnaien
and L. Khoukhi
, Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks, Computers, 59 (2015)
, 11-21.
doi: 10.1016/j.cor.2014.11.002.
|
|
O. Simeone
, A. Maeder
, M. Peng
, O. Sahin
and W. Yu
, Cloud radio access network: Virtualizing wireless access for dense heterogeneous systems, Journal of Communications and Networks, 18 (2016)
, 135-149.
doi: 10.1109/JCN.2016.000023.
|
|
A. J. V. Skriver
and K. A. Andersen
, The bicriterion semi-obnoxious location (bsl) problem solved by an [epsilon]-approximation, European Journal of Operational Research, 146 (2003)
, 517-528.
doi: 10.1016/S0377-2217(02)00271-0.
|
|
J. L. Williams
, J. W. Fisher
and A. S. Willsky
, Approximate dynamic programming for communication-constrained sensor network management, IEEE Transactions on Signal Processing, 55 (2007)
, 4300-4311.
doi: 10.1109/TSP.2007.896099.
|
|
D. Wood
, An algorithm for finding a maximum clique in a graph, Operation Research Letters, 21 (1997)
, 211-217.
doi: 10.1016/S0167-6377(97)00054-0.
|
|
IBM, IBM ILOG CPLEX Optimizer,
www.ibm.com/software/commerce/optimization/cplex-optimizer/, Last retrieved April 2015.
|
|
The 5G Infrastructure Public Private Partnership,
https://5g-ppp.eu/.
|