Optimization Problems in Telecommunications with Military Applications

摘要: In recent decades, optimization problems in telecommunication systems have been the focus of an intensive amount research. These are important for several reasons including speed and quality communication among others. this dissertation, we present arising networks military applications. Several consider involve wireless networks. extraordinarily convenient method communication. However, along with convenience comes a myriad complicated that must be addressed to preserve attractive features Furthermore, adversarial environments differ from those conventional settings, time is usually critically constrained factor. This troublesome because many difficult solve would require tremendous compute optimal solution. However battlespace environment, spent computing solution not fighting enemy leads potential loss materiel lives. Thus studied, will great deal attention on designing heuristic algorithms which capable near solutions very efficiently. We two classes involving The first class focuses denying network destroying its functionality. other has objective guaranteeing network. At glance, these sets appear polar opposites one another. any emerging technology studies assess both vulnerabilities capabilities performed order achieve system fail intended operational environment. Our goal show how can formulated solved using tools global combinatorial optimization. For considered, examine computational complexity mathematical programming formulations. Then extensive results comparing their effectiveness. Finally, conclude by summarizing our work indicating future directions ( en )