Year |
Citation |
Score |
2020 |
Sartori CS, Buriol LS. A study on the pickup and delivery problem with time windows: Matheuristics and new instances Computers & Operations Research. 124: 105065. DOI: 10.1016/J.Cor.2020.105065 |
0.483 |
|
2020 |
Wickert TI, Neto AFK, Boniatti MM, Buriol LS. An integer programming approach for the physician rostering problem Annals of Operations Research. 1-28. DOI: 10.1007/S10479-020-03552-5 |
0.427 |
|
2019 |
Stefanello F, Aggarwal V, Buriol LS, Resende MGC. Hybrid algorithms for placement of virtual machines across geo-separated data centers Journal of Combinatorial Optimization. 38: 748-793. DOI: 10.1007/S10878-019-00411-3 |
0.479 |
|
2018 |
Friske MW, Buriol LS, Camponogara E. A Branch-and-Price algorithm for a compressor scheduling problem Computers & Industrial Engineering. 116: 72-81. DOI: 10.1016/J.Cie.2017.12.022 |
0.47 |
|
2017 |
Dorneles ÁP, de Araújo OC, Buriol LS. A column generation approach to high school timetabling modeled as a multicommodity flow problem European Journal of Operational Research. 256: 685-695. DOI: 10.1016/J.Ejor.2016.07.002 |
0.437 |
|
2017 |
Luizelli MC, da Costa Cordeiro WL, Buriol LS, Gaspary LP. A fix-and-optimize approach for efficient and large scale virtual network function placement and chaining Computer Communications. 102: 67-77. DOI: 10.1016/J.Comcom.2016.11.002 |
0.435 |
|
2017 |
Moura LF, Gaspary LP, Buriol LS. A branch-and-price algorithm for the single-path virtual network embedding problem Networks. 71: 188-208. DOI: 10.1002/net.21798 |
0.376 |
|
2016 |
Pereira AG, Ritt M, Buriol LS. Pull and PushPull are PSPACE-complete Theoretical Computer Science. 628: 50-61. DOI: 10.1016/J.Tcs.2016.03.012 |
0.428 |
|
2015 |
Stefanello F, Aggarwal V, Buriol LS, Gonçalves JF, Resende MGC. A biased random-key genetic algorithm for placement of virtual machines across geo-separated data centers Gecco 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference. 919-926. DOI: 10.1145/2739480.2754768 |
0.355 |
|
2015 |
Pereira AG, Ritt M, Buriol LS. Optimal Sokoban solving using pattern databases with specific domain knowledge Artificial Intelligence. 227: 52-70. DOI: 10.1016/J.Artint.2015.05.011 |
0.366 |
|
2015 |
Stefanello F, Buriol LS, Hirsch MJ, Pardalos PM, Querido T, Resende MGC, Ritt M. On the minimization of traffic congestion in road networks with tolls Annals of Operations Research. DOI: 10.1007/S10479-015-1800-1 |
0.495 |
|
2015 |
Portal GM, Ritt M, Borba LM, Buriol LS. Simulated annealing for the machine reassignment problem Annals of Operations Research. 242: 93-114. DOI: 10.1007/S10479-014-1771-7 |
0.412 |
|
2014 |
Dorn M, E Silva MB, Buriol LS, Lamb LC. Three-dimensional protein structure prediction: Methods and computational strategies. Computational Biology and Chemistry. 53: 251-276. PMID 25462334 DOI: 10.1016/J.Compbiolchem.2014.10.001 |
0.735 |
|
2014 |
Dorneles ÁP, de Araújo OC, Buriol LS. A fix-and-optimize heuristic for the high school timetabling problem Computers & Operations Research. 52: 29-38. DOI: 10.1016/J.Cor.2014.06.023 |
0.403 |
|
2014 |
Dorn M, Buriol LS, Lamb LC. MOIRAE: A computational strategy to extract and represent structural information from experimental protein templates Soft Computing. 18: 773-795. DOI: 10.1007/s00500-013-1087-6 |
0.715 |
|
2013 |
Dorn M, Buriol LS, Lamb LC. A molecular dynamics and knowledge-based computational strategy to predict native-like structures of polypeptides Expert Systems With Applications. 40: 698-706. DOI: 10.1016/J.Eswa.2012.08.003 |
0.727 |
|
2013 |
Bezerra LC, Goldbarg EF, Goldbarg MC, Buriol LS. Analyzing the impact of MOACO components: An algorithmic study on the multi-objective shortest path problem Expert Systems With Applications. 40: 345-355. DOI: 10.1016/J.Eswa.2012.07.052 |
0.472 |
|
2013 |
Benavides AJ, Ritt M, Buriol LS, França PM. An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks Computers & Operations Research. 40: 24-32. DOI: 10.1016/J.Cor.2012.05.006 |
0.687 |
|
2011 |
Dorn M, Buriol LS, Lamb LC. Combining machine learning and optimization techniques to determine 3-D structures of polypeptides Ijcai International Joint Conference On Artificial Intelligence. 2794-2795. DOI: 10.5591/978-1-57735-516-8/IJCAI11-469 |
0.73 |
|
2011 |
Dorn M, Buriol LS, Lamb LC. A hybrid genetic algorithm for the 3-D protein structure prediction problem using a path-relinking strategy 2011 Ieee Congress of Evolutionary Computation, Cec 2011. 2709-2716. DOI: 10.1109/CEC.2011.5949957 |
0.746 |
|
2011 |
da Silva R, Buriol LS, Ribeiro L, Dotti FL. Modeling the webgraph evolution Journal of Computational Science. 2: 67-79. DOI: 10.1016/J.Jocs.2010.11.003 |
0.342 |
|
2010 |
Reis R, Ritt M, Buriol LS, Resende MGC. A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion International Transactions in Operational Research. 18: 401-423. DOI: 10.1111/J.1475-3995.2010.00771.X |
0.429 |
|
2010 |
Buriol LS, Hirsch MJ, Pardalos PM, Querido T, Resende MGC, Ritt M. A biased random-key genetic algorithm for road congestion minimization Optimization Letters. 4: 619-633. DOI: 10.1007/S11590-010-0226-6 |
0.512 |
|
2008 |
Buriol LS, Resende MGC, Thorup M. Speeding Up Dynamic Shortest-Path Algorithms Informs Journal On Computing. 20: 191-204. DOI: 10.1287/Ijoc.1070.0231 |
0.39 |
|
2006 |
FranÇa PM, Tin G, Buriol LS. Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions International Journal of Production Research. 44: 939-957. DOI: 10.1080/00207540500282914 |
0.711 |
|
2006 |
Buriol L, Resende M, Thorup M. Survivable IP network design with OSPF routing Networks. 49: 51-64. DOI: 10.1002/Net.V49:1 |
0.693 |
|
2005 |
Buriol L, Resende M, Ribeiro C, Thorup M. A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing Networks. 46: 36-56. DOI: 10.1002/Net.V46:1 |
0.727 |
|
2004 |
Buriol L, França PM, Moscato P. A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem Journal of Heuristics. 10: 483-506. DOI: 10.1023/B:Heur.0000045321.59202.52 |
0.715 |
|
Show low-probability matches. |