Luciana Salete Buriol
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Luciana Salete Buriol has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Marcus Ritt
Institute of Informatics Universidade Federal do Rio Grande do Sul Porto Alegre Brazil
5 shared publications - Mauricio G. C. Resende
Institute of Science and Technology, Federal University of São Paulo, Rua Pedro Vicente 625, São Paulo 01109, Brazil
4 shared publications - André Grahl Pereira
Federal University of Rio Grande do Sul
3 shared publications - Henrique Becker
Graduate Programming in Computing Federal University of the Rio Grande do Sul (UFRGS) Porto Alegre 91 501‐970 Brazil
3 shared publications - Olinto César Bassi de Araújo
Federal University of Santa Maria
3 shared publications - Fernando Stefanello
Federal University of Rio Grande do Sul
2 shared publications
Latest Publications
- 17 October 2025
- Published by Springer Nature
- p. 1523-1540
Network Optimization
- 24 May 2024
- Published by Springer Nature
- p. 619-636
Improved Routing for the In-Band Network Telemetry Problem
- 24 May 2024
- Published by Springer Nature
- p. 619-636
Improved Routing for the In-Band Network Telemetry Problem
- 3 August 2023
- Published by Wiley in International Transactions in Operational Research
- Vol. 31 (5) , 3010-3035
Comparative analysis of mathematical formulations for the two‐dimensional guillotine cutting problem
About 15 years ago, a paper proposed the first integer linear programming formulation for the constrained two‐dimensional guillotine cutting problem (with unlimited cutting stages). Since then, eight other formulations followed, seven of them in the last four years. This spike of interest gave no opportunity for a comprehensive comparison between the formulations. We review each formulation and compare their empirical results over instance datasets of the literature. We adapt most formulations to allow for piece rotation. The possibility of adaptation was already predicted but not realized by the prior work. The results show the dominance of pseudo‐polynomial formulations until the point instances become intractable by them, while more compact formulations keep achieving good primal solutions. Our study also reveals a mistake in the generation of the T instances, which should have the same optima with or without guillotine cuts. We also propose hybridising a recent formulation with a prior formulation for a restricted version of the problem. The hybridisations show a reduction of about 20% of the branch‐and‐bound time thanks to the symmetries broken by the hybridisation.
- 3 August 2023
- Published by Wiley in International Transactions in Operational Research
- Vol. 31 (5) , 3010-3035
Comparative analysis of mathematical formulations for the two‐dimensional guillotine cutting problem
About 15 years ago, a paper proposed the first integer linear programming formulation for the constrained two‐dimensional guillotine cutting problem (with unlimited cutting stages). Since then, eight other formulations followed, seven of them in the last four years. This spike of interest gave no opportunity for a comprehensive comparison between the formulations. We review each formulation and compare their empirical results over instance datasets of the literature. We adapt most formulations to allow for piece rotation. The possibility of adaptation was already predicted but not realized by the prior work. The results show the dominance of pseudo‐polynomial formulations until the point instances become intractable by them, while more compact formulations keep achieving good primal solutions. Our study also reveals a mistake in the generation of the T instances, which should have the same optima with or without guillotine cuts. We also propose hybridising a recent formulation with a prior formulation for a restricted version of the problem. The hybridisations show a reduction of about 20% of the branch‐and‐bound time thanks to the symmetries broken by the hybridisation.
- Open Access
- 12 July 2022
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 14 (4) , 673-697
Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem
We advance the state of the art in Mixed-Integer Linear Programming formulations for Guillotine 2D Cutting Problems by (i) adapting a previously-known reduction to our preprocessing phase (plate-size normalization) and by (ii) enhancing a previous formulation (PP-G2KP from Furini et alli) by cutting down its size and symmetries. Our focus is the Guillotine 2D Knapsack Problem with orthogonal and unrestricted cuts, constrained demand, unlimited stages, and no rotation – however, the formulation may be adapted to many related problems. The code is available. Concerning the set of 59 instances used to benchmark the original formulation, the enhanced formulation takes about 4 hours to solve all instances while the original formulation takes 12 hours to solve 53 of them (the other six runs hit a three-hour time limit each). We integrate, to both formulations, a pricing framework proposed for the original formulation; the enhanced formulation keeps a significant advantage in this situation. Finally, in a recently proposed set of 80 harder instances, the enhanced formulation (with and without the pricing framework) found: 22 optimal solutions (5 already known, 17 new); better lower bounds for 25 instances; better upper bounds for 58 instances.
- 12 July 2022
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 14 (4) , 673-697
Open AccessEnhanced formulation for the Guillotine 2D Cutting Knapsack Problem
We advance the state of the art in Mixed-Integer Linear Programming formulations for Guillotine 2D Cutting Problems by (i) adapting a previously-known reduction to our preprocessing phase (plate-size normalization) and by (ii) enhancing a previous formulation (PP-G2KP from Furini et alli) by cutting down its size and symmetries. Our focus is the Guillotine 2D Knapsack Problem with orthogonal and unrestricted cuts, constrained demand, unlimited stages, and no rotation – however, the formulation may be adapted to many related problems. The code is available. Concerning the set of 59 instances used to benchmark the original formulation, the enhanced formulation takes about 4 hours to solve all instances while the original formulation takes 12 hours to solve 53 of them (the other six runs hit a three-hour time limit each). We integrate, to both formulations, a pricing framework proposed for the original formulation; the enhanced formulation keeps a significant advantage in this situation. Finally, in a recently proposed set of 80 harder instances, the enhanced formulation (with and without the pricing framework) found: 22 optimal solutions (5 already known, 17 new); better lower bounds for 25 instances; better upper bounds for 58 instances.
- Open Access
- 30 June 2020
- Published by Sociedade Brasileira de Computação
- p. 31-36
Personnel rostering: models and algorithms for scheduling, rescheduling and ensuring robustness
Personnel rostering is the process of assigning employees to shifts while respecting a set of constraints. Despite progress in recent decades concerning computation techniques, a considerable number of organizations continue to organize their rosters manually. This thesis seeks to bridge the gap between academia and practice by (i) introducing an integer programming model based on a real-world demand and a matheuristic to quickly generate results, (ii) producing state-of-the-art results for cyclic rostering problems using instances available in the literature, (iii) designing new rerostering strategies for repairing disruptions in multi-skilled rostering scenarios, and (iv) introducing a metric for quantifying and enforcing robustness in rosters. Besides the scientific contributions resulted from the thesis, this work is also relevant in practice. Since April of 2019, Hospital de Clínicas de Porto Alegre employs this PhD's outcome, named ProScheduleSolver to compute its physicians' rosters. The automation takes a few minutes, as opposed to multiple hours in the past, and results in 24,7\% less overtime for the physicians.
- 30 June 2020
- Published by Sociedade Brasileira de Computação
- p. 31-36
Open AccessPersonnel rostering: models and algorithms for scheduling, rescheduling and ensuring robustness
Personnel rostering is the process of assigning employees to shifts while respecting a set of constraints. Despite progress in recent decades concerning computation techniques, a considerable number of organizations continue to organize their rosters manually. This thesis seeks to bridge the gap between academia and practice by (i) introducing an integer programming model based on a real-world demand and a matheuristic to quickly generate results, (ii) producing state-of-the-art results for cyclic rostering problems using instances available in the literature, (iii) designing new rerostering strategies for repairing disruptions in multi-skilled rostering scenarios, and (iv) introducing a metric for quantifying and enforcing robustness in rosters. Besides the scientific contributions resulted from the thesis, this work is also relevant in practice. Since April of 2019, Hospital de Clínicas de Porto Alegre employs this PhD's outcome, named ProScheduleSolver to compute its physicians' rosters. The automation takes a few minutes, as opposed to multiple hours in the past, and results in 24,7\% less overtime for the physicians.
- Open Access
- 25 June 2020
- Published by Association for Computing Machinery (ACM)
- p. 717-724
A biased random key genetic algorithm applied to the VRPTW with skill requirements and synchronization constraints
We applied a Biased Random Key Genetic Algorithm (BRKGA) to solve the Vehicle Routing Problem with Time Windows and Synchronization Constraints. Additionally, both vehicles and clients are skilled, and each client can require up to two distinct skills to be serviced. On double-skilled clients, the operations of each skill should be performed by different vehicles, either simultaneously or respecting a precedence order. Those requirements introduce nonlinearities on the problem, in the sense that a small change on a single route potentially impacts all the other routes of the solution, making it hard to define an effective local search procedure. To circumvent this difficulty, we approached the problem using a genetic algorithm that evolves the sequence in which the services are inserted into the routes. We assessed the performance of our solution method using instances from the literature of the home health care problem. The genetic algorithm outperformed the previous best-known solutions found by a fix-and-optimize matheuristic by up to 25%, using less than half of computational times reported previously. The BRKGA demonstrated to be able to perform well both in exploration and exploitation in the solution space of the problem.
- 25 June 2020
- Published by Association for Computing Machinery (ACM)
- p. 717-724
Open AccessA biased random key genetic algorithm applied to the VRPTW with skill requirements and synchronization constraints
We applied a Biased Random Key Genetic Algorithm (BRKGA) to solve the Vehicle Routing Problem with Time Windows and Synchronization Constraints. Additionally, both vehicles and clients are skilled, and each client can require up to two distinct skills to be serviced. On double-skilled clients, the operations of each skill should be performed by different vehicles, either simultaneously or respecting a precedence order. Those requirements introduce nonlinearities on the problem, in the sense that a small change on a single route potentially impacts all the other routes of the solution, making it hard to define an effective local search procedure. To circumvent this difficulty, we approached the problem using a genetic algorithm that evolves the sequence in which the services are inserted into the routes. We assessed the performance of our solution method using instances from the literature of the home health care problem. The genetic algorithm outperformed the previous best-known solutions found by a fix-and-optimize matheuristic by up to 25%, using less than half of computational times reported previously. The BRKGA demonstrated to be able to perform well both in exploration and exploitation in the solution space of the problem.
- 28 February 2020
- Published by Springer Nature in Annals of Operations Research
- Vol. 302 (2) , 363-390
An integer programming approach for the physician rostering problem
- 28 February 2020
- Published by Springer Nature in Annals of Operations Research
- Vol. 302 (2) , 363-390
An integer programming approach for the physician rostering problem
- Open Access
- 1 January 2020
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 40
THE GUIDE TO NP-COMPLETENESS IS 40 YEARS OLD: AN HOMAGE TO DAVID S. JOHNSON
1 JOHNSON’S CONTRIBUTIONS TO NP-COMPLETENESS
- 1 January 2020
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 40
Open AccessTHE GUIDE TO NP-COMPLETENESS IS 40 YEARS OLD: AN HOMAGE TO DAVID S. JOHNSON
1 JOHNSON’S CONTRIBUTIONS TO NP-COMPLETENESS
- 10 May 2019
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 38 (3) , 748-793
Hybrid algorithms for placement of virtual machines across geo-separated data centers
- 10 May 2019
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 38 (3) , 748-793
Hybrid algorithms for placement of virtual machines across geo-separated data centers
- 14 August 2018
- Published by Springer Nature
- p. 1123-1140
Network Optimization