Construct, merge, solve & adapt a new general algorithm for combinatorial optimization
This paper describes a general hybrid metaheuristic for combinatorial optimization labelled
Construct, Merge, Solve & Adapt. The proposed algorithm is a specific instantiation of a …
Construct, Merge, Solve & Adapt. The proposed algorithm is a specific instantiation of a …
Minimizing routing energy consumption: from theoretical to practical results
F Giroire, D Mazauric, J Moulierac… - 2010 IEEE/ACM Int'l …, 2010 - ieeexplore.ieee.org
Several studies exhibit that the traffic load of the routers only has a small influence on their
energy consumption. Hence, the power consumption in networks is strongly related to the …
energy consumption. Hence, the power consumption in networks is strongly related to the …
Metaheuristic hybrids
Over the last decades, so-called hybrid optimization approaches have become increasingly
popular for addressing hard optimization problems. In fact, when looking at leading …
popular for addressing hard optimization problems. In fact, when looking at leading …
[图书][B] Hybrid metaheuristics
One of the most interesting recent trends for what concerns research on metaheuristics is
their hybridization with other techniques for optimization. In fact, the focus of research on …
their hybridization with other techniques for optimization. In fact, the focus of research on …
Network Slicing vs. Network Neutrality–Is Consent Possible?
L Tomaszewski, R Kołakowski - IFIP International Conference on Artificial …, 2023 - Springer
Network Slicing (NS) is the inherent concept of the 5G network and beyond, ensuring
dynamic and flexible use of resources, considered also a fundamental enabler of the …
dynamic and flexible use of resources, considered also a fundamental enabler of the …
Design of survivable wireless backhaul networks with reliability considerations
The ever-increasing need for stable, seamless, high-speed connectivity places an enormous
burden on the communications infrastructure, comprised of access, backhaul, and core …
burden on the communications infrastructure, comprised of access, backhaul, and core …
A chance-constrained model and cutting planes for fixed broadband wireless networks
G Claßen, D Coudert, AMCA Koster… - … Conference on Network …, 2011 - Springer
In this paper, we propose a chance-constrained mathematical program for fixed broadband
wireless networks under unreliable channel conditions. The model is reformulated as an …
wireless networks under unreliable channel conditions. The model is reformulated as an …
Chance-constrained optimization of reliable fixed broadband wireless networks
G Classen, AMCA Koster, D Coudert… - INFORMS Journal …, 2014 - pubsonline.informs.org
In this paper, we extend our former investigation on conceiving reliable fixed point-to-point
wireless networks under outage probability constraints. We consider the problem of …
wireless networks under outage probability constraints. We consider the problem of …
A matheuristic for the minimum weight rooted arborescence problem
The combinatorial optimization problem tackled in this work is from the family of minimum
weight rooted arborescence problems. The problem is NP-hard and has applications, for …
weight rooted arborescence problems. The problem is NP-hard and has applications, for …
Network optimization for wireless microwave backhaul
N Nepomuceno - 2010 - theses.hal.science
Technological breakthroughs have transformed the telecommunications industry aiming at
providing capacity and efficiency to support the increasing demand for wireless broadband …
providing capacity and efficiency to support the increasing demand for wireless broadband …