Multi-level decision making
G Zhang, J Lu, Y Gao - Models, Methods and Applications, 2015 - Springer
Multi-level decision-making (MLDM) handles problems that require compromise between
the objectives of two or more interacting entities which are arranged within a hierarchical …
the objectives of two or more interacting entities which are arranged within a hierarchical …
Integer programming techniques for the nurse rostering problem
HG Santos, TAM Toffolo, RAM Gomes… - Annals of Operations …, 2016 - Springer
This work presents integer programming techniques to tackle the problem of the
International Nurse Rostering Competition. Starting from a compact and monolithic …
International Nurse Rostering Competition. Starting from a compact and monolithic …
Metaheuristic algorithms for wireless sensor networks
This chapter presents the main concepts of metaheuristic schemes for Wireless Sensor
Networks (WSNs). WSNs are multi-functional, low-cost, and low-power networks and rely on …
Networks (WSNs). WSNs are multi-functional, low-cost, and low-power networks and rely on …
Branch‐and‐cut and hybrid local search for the multi‐level capacitated minimum spanning tree problem
We propose algorithms to compute tight lower bounds and high quality upper bounds (UBs)
for the multilevel capacitated minimum spanning tree problem. We first develop a branch …
for the multilevel capacitated minimum spanning tree problem. We first develop a branch …
A hybrid vns algorithm for solving the multi-level capacitated minimum spanning tree problem
JCT Campos, AX Martins, MJF Souza - Electronic Notes in Discrete …, 2018 - Elsevier
This work addresses the multi-level capacitated minimum spanning tree (MLCMST)
problem. It consists of finding a minimal cost spanning tree such that the flow to be …
problem. It consists of finding a minimal cost spanning tree such that the flow to be …
Capacitated Graph Theoretical Algorithms for Wireless Sensor Networks Towards Internet of Things
Main components of internet of things such as wireless sensor networks (WSNs) are
generally modeled as graphs. Matching, dominating set, spanning tree, and vertex cover are …
generally modeled as graphs. Matching, dominating set, spanning tree, and vertex cover are …
Metaheurísticas e formulações para a resolução do problema de roteamento e alocação de comprimentos de onda em redes ópticas
AX Martins - 2011 - theses.hal.science
Résumé This work deals with the routing and Wavelength assignment (RWA) in optical
WDM networks independently on the underlying physical topology. We begin with a review …
WDM networks independently on the underlying physical topology. We begin with a review …
Multi-layer network design problems in telecommunication
İ Yüksel Ergün - 2013 - open.metu.edu.tr
The telecommunication network design problem is to configure a telecommunication
network of major hardware and their links in order to satisfy traffic demands and flows …
network of major hardware and their links in order to satisfy traffic demands and flows …
Heuristics for the multi-level capacitated minimum spanning tree problem
CA Pappas, ACG Anadiotis, CA Papagianni… - Optimization …, 2014 - Springer
The capacitated minimum spanning tree (CMST) problem is fundamental to the design of
centralized communication networks. In this paper we consider the multi-level capacitated …
centralized communication networks. In this paper we consider the multi-level capacitated …
[PDF][PDF] Decomposition-based algorithms for optimization problems
TAM Toffolo - 2017 - lirias.kuleuven.be
Throughout the last several decades there has been remarkable progress within the
Operational Research (OR) field. The amount of progress is particularly significant when …
Operational Research (OR) field. The amount of progress is particularly significant when …