Optimization in Designing Complex Communication Networks

DOI10.1007/978-1-4614-0754-6_1zbMath1247.90083OpenAlexW976755497MaRDI QIDQ2913773

Fernanda S. H. Souza, Alexandre Salles da Cunha, Geraldo Robson Mateus

Publication date: 27 September 2012

Published in: Handbook of Optimization in Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0754-6_1

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of mathematical programming (90C90) Communication networks in operations research (90B18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Greedy randomized adaptive search procedures
• Branching rules revisited
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• OR FORUM—Catching the “Network Science” Bug: Insight and Opportunity for the Operations Researcher
• Handbook of Approximation Algorithms and Metaheuristics
• The Structure and Function of Complex Networks
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Collective dynamics of ‘small-world’ networks
• A Primer in Column Generation
• Shortest Path Problems with Resource Constraints
• Combining Column Generation and Lagrangian Relaxation
• Random Graphs