Luis Stábile
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Luis Stábile has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
Eduardo Canale
Universidad de la República
3 shared publicationsFranco Robledo
Universidad de la República
3 shared publications- Franco Robledo
Facultad de Ingenieria, Universidad de la Republica, Montevideo 11300, Uruguay
3 shared publications Pablo Romero
Universidad de la República
3 shared publications- Eduardo Canale
Instituto de Matemática y Estadística Facultad de Ingeniería Universidad de la República Montevideo Uruguay
2 shared publications Mathias Bourel
Universidad de la República
2 shared publications
Latest Publications
- Open Access
Solving the Max-Diversity Orthogonal Regrouping Problem by an Integer Linear Programming Model and a GRASP/VND with Path-Relinking Approach
Students from Master of Business Administration (MBA) programs are usually split into teams. In light of the generalistic nature of MBA programs, diversity within every team is desirable in terms of gender, major, age and other criteria. Many schools rotate the teams at the beginning of every term so that each student works with a different set of peers during every term, thus training his or her adaptation skills and expanding the peer network. Achieving diverse teams while avoiding–or minimizing—the repetition of student pairs is a complex and time-consuming task for MBA Directors. We introduce the Max-Diversity Orthogonal Regrouping (MDOR) problem to manage the challenge of splitting a group of people into teams several times, pursuing the goals of high diversity and few repetitions. We propose a hybrid Greedy Randomized Adaptive Search Procedure/Variable Neighborhood Descent (GRASP/VND) heuristic combined with tabu search and path relinking for its resolution, as well as an Integer Linear Programming (ILP) formulation. We compare both approaches through a set of real MBA cohorts, and the results show that, in all cases, the heuristic approach significantly outperforms the ILP and manually formed teams in terms of both diversity and repetition levels.
Open AccessSolving the Max-Diversity Orthogonal Regrouping Problem by an Integer Linear Programming Model and a GRASP/VND with Path-Relinking Approach
Students from Master of Business Administration (MBA) programs are usually split into teams. In light of the generalistic nature of MBA programs, diversity within every team is desirable in terms of gender, major, age and other criteria. Many schools rotate the teams at the beginning of every term so that each student works with a different set of peers during every term, thus training his or her adaptation skills and expanding the peer network. Achieving diverse teams while avoiding–or minimizing—the repetition of student pairs is a complex and time-consuming task for MBA Directors. We introduce the Max-Diversity Orthogonal Regrouping (MDOR) problem to manage the challenge of splitting a group of people into teams several times, pursuing the goals of high diversity and few repetitions. We propose a hybrid Greedy Randomized Adaptive Search Procedure/Variable Neighborhood Descent (GRASP/VND) heuristic combined with tabu search and path relinking for its resolution, as well as an Integer Linear Programming (ILP) formulation. We compare both approaches through a set of real MBA cohorts, and the results show that, in all cases, the heuristic approach significantly outperforms the ILP and manually formed teams in terms of both diversity and repetition levels.
- Open Access
- 1 July 2020
- Published by IntechOpen
A Survivable and Reliable Network Topological Design Model
This work is focused on the resolution of a mixed model for the design of large-sized networks. An algorithm is introduced, whose initial outcomes are promising in terms of topological robustness regarding connectivity and reliability. The algorithm combines the network survivability and the network reliability approaches. The problem of the topological design has been modeled based on the generalized Steiner problem with node-connectivity constraints (GSPNC), which is NP-hard. The aim of this study is to heuristically solve the GSP-NC model by designing low-cost highly connected topologies and to measure the reliability of such solutions with respect to a certain prefixed lower threshold. This research introduces a greedy randomized algorithm for the construction of feasible solutions for the GSP-NC and a local search algorithm based on the variable neighborhood search (VNS) method, customized for the GSP-NC. In order to compute the built network reliabilities, this work adapts the recursive variance reduction (RVR) technique, as a simulation method since the exact evaluation of this measurement is also NP-hard. The experimental tests were performed over a wide set of testing cases, which contained heterogeneous topologies, including instances of more than 200 nodes. The computational results showed highly competitive execution times, achieving minimal local optimal solutions of good quality fulfilling the imposed survivability and reliability conditions.
- 1 July 2020
- Published by IntechOpen
Open AccessA Survivable and Reliable Network Topological Design Model
This work is focused on the resolution of a mixed model for the design of large-sized networks. An algorithm is introduced, whose initial outcomes are promising in terms of topological robustness regarding connectivity and reliability. The algorithm combines the network survivability and the network reliability approaches. The problem of the topological design has been modeled based on the generalized Steiner problem with node-connectivity constraints (GSPNC), which is NP-hard. The aim of this study is to heuristically solve the GSP-NC model by designing low-cost highly connected topologies and to measure the reliability of such solutions with respect to a certain prefixed lower threshold. This research introduces a greedy randomized algorithm for the construction of feasible solutions for the GSP-NC and a local search algorithm based on the variable neighborhood search (VNS) method, customized for the GSP-NC. In order to compute the built network reliabilities, this work adapts the recursive variance reduction (RVR) technique, as a simulation method since the exact evaluation of this measurement is also NP-hard. The experimental tests were performed over a wide set of testing cases, which contained heterogeneous topologies, including instances of more than 200 nodes. The computational results showed highly competitive execution times, achieving minimal local optimal solutions of good quality fulfilling the imposed survivability and reliability conditions.
- 29 April 2020
- Published by Wiley in International Transactions in Operational Research
- Vol. 29 (2) , 908-928
Complexity and heuristics for the weighted max cut‐clique problem
- 29 April 2020
- Published by Wiley in International Transactions in Operational Research
- Vol. 29 (2) , 908-928
Complexity and heuristics for the weighted max cut‐clique problem
- 14 March 2019
- Published by Springer Nature
- p. 28-40
Complexity and Heuristics for the Max Cut-Clique Problem
- 14 March 2019
- Published by Springer Nature
- p. 28-40
Complexity and Heuristics for the Max Cut-Clique Problem
- Open Access
- 14 February 2019
- Published by Springer Nature
- p. 357-367
A GRASP/VND Heuristic for the Max Cut-Clique Problem
- 14 February 2019
- Published by Springer Nature
- p. 357-367
Open AccessA GRASP/VND Heuristic for the Max Cut-Clique Problem
- 18 December 2018
- Published by Springer Nature
- p. 78-92
A Hybrid GRASP/VND Heuristic for the Design of Highly Reliable Networks
- 18 December 2018
- Published by Springer Nature
- p. 78-92
A Hybrid GRASP/VND Heuristic for the Design of Highly Reliable Networks