Bibliography
4 entries
“Applying a Random-Key Optimizer to Mixed Integer Programs,” (with A.A. Chaves, C.E. Schmidt, J. Kyle Brubaker, H.G. Katzgraber, and M.J.A. Schuetz). Submitted for publication, 2026.
https://doi.org/10.21203/rs.3.rs-9390292/v1
“The one-dimensional cutting stock problem with sequence-dependent setups,” (with E. M. Silva, A. A. Chaves, and S. A. de Araujo). Submitted for publication, 2026.
“Minimum Roman 3-Domination Problem: A hybrid metaheuristic approach,” (with A. Casado, J. Sánchez-Oro, and A. Duarte). Submitted for publication, 2025.
“Biased Random-Key Genetic Algorithm with Variable Mutant to solve a Vehicle Routing Problem,” (with P. Festa, F. Guerriero, and E. Scalzo). Submitted for publication, 2024.
https://doi.org/10.2139/ssrn.4828115
209 entries
“On the Use of Biased-Randomized Transformers as Data-Driven Heuristics for Agile Optimization,” (with Angel A. Juan, Antoni Guerrero, Marc Escoto, Javier Panadero, and Alvaro Garcia-Sanchez). Information, vol. 17, issue 5, article 504, 2026.
https://doi.org/10.3390/info17050504
“Metaheuristic algorithms for the induced p-median problem with upgrades,” (with S. Salazar, A. Duarte, and J. M. Colmenar). Knowledge-Based Systems, vol. 339, ppr. 1155792026, 2026.
https://doi.org/10.1016/j.knosys.2026.115579
“Random-Key Genetic Algorithms: Principles and Applications,” (with M.A. Londe, L.S. Pessoa, C.E. Andrade, and J.F. Gonçalves). In Handbook of Heuristics – Second Edition, R. Martí, P.M. Pardalos, and M.G.C. Resende (eds), pp. 921–939. Springer, Cham. 26 September 2025.
https://doi.org/10.1007/978-3-032-00385-0_30
“GRASP,” (with D. Ferone and P. Festa). In Handbook of Heuristics – Second Edition, R. Martí, P.M. Pardalos, and M.G.C. Resende (eds), pp. 663-686. Springer, Cham. 26 September 2025.
https://doi.org/10.1007/978-3-032-00385-0_23
“A Random-Key Optimizer for Combinatorial Optimization,” (with A.A. Chaves, M.J.A. Schuetz, J.K. Brubaker, H.G. Katzgraber, E.F. de Arruda, and R.M.A. Silva). J. of Heuristics, 26 September 2025. https://doi.org/10.1007/s10732-025-09568-z
“The connected Grundy coloring problem: Formulations and a local-search enhanced biased random-key genetic algorithm,” (with M. Carvalho, R.A. Melo, M.C. Santos, and R.F. Toso). Published online in Computers & Operations Research, vol. 183, pp. 10713628, 2025.
https://doi.org/10.1016/j.cor.2025.107136
“Greedy Randomized Adaptive Search Procedures with Path Relinking. An analytical review of designs and implementations,” (with M. Laguna, R. Martí, A. Martínez-Gavara, and S. Pérez-Peló), Published online in European J. of Operational Research, vol. 327, pp. 717–734, 2025.
https://doi.org/10.1016/j.ejor.2025.02.022
“Biased random-key genetic algorithms: A review,” (with M.A. Londe, L.S. Pessoa and C.E. de Andrade). European J. of Operational Research, vol, 321, pp. 1–22, 2025.
https://doi.org/10.1016/j.ejor.2024.03.030.
“Two-phase GRASP for the Multi-Constraint Graph Partitioning Problem,” (with A. Herrán, J.M. Colmenar), Computers & Operations Research, vol. 176, pp. 106946, 2025.
https://doi.org/10.1016/j.cor.2024.106946.
“A metaheuristic algorithm for large maximum weight independent set problems,” (with Y. Dong, A.V. Goldberg, A. Noe, N. Parotsidis, and Q. Spaen). Networks, vol. 85, pp. 91–112, 2025.
https://doi.org/10.1002/net.22247.
“Early years of Biased Random-Key Genetic Algorithms: A systematic review,” (with M.A. Londe, L.S. Pessoa and C.E. de Andrade). J. of Global Optimization, published online 6 November 2024. https://doi.org/10.1007/s10898-024-01446-5
“A Random-Key GRASP for Combinatorial Optimization,” (with A.A. Chaves and R.M.A. Silva). J. of Nonlinear and Variational Analysis, vol. 8, issue 6, pp. 855-881, 2024,
https://doi.org/10.23952/jnva.8.2024.6.03.
“Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be?,” (with M. C. Silva, R. A. Melo, M. C. Santos and R. F. Toso). Computers & Operations Research, vol. 168, pp. 106703, 2024, https://doi.org/10.1016/j.cor.2024.106703.
“A biased random-key genetic algorithm for the home health care problem,” (with A.F. Kummer, O.C.B. de Araújo, and L.S. Buriol). International Transactions in Operational Research, vol. 31, pp. 1859–1889, 2024, https://doi.org/10.1111/itor.13221.
“Amazon Locker Capacity Management,” (with S. Sethuraman, A. Bansal, S. Mardan, and T. L. Jacobs). INFORMS Journal on Applied Analytics, vol. 54, pp. 455–574, 2024.
https://doi.org/10.1287/inte.2023.0005.
“Efficient GRASP solution approach for the prisoner transportation problem,” (with D. Ferone, P. Festa, and T. Pastore). Computers & Operations Research, vol. 153, pp. 106161, 2023.
https://doi.org/10.1016/j.cor.2023.106161
“Optimization of robot-trajectory planning with nature-inspired and hybrid quantum algorithms,” (with M.J.A. Schuetz, J.K. Brubaker, H. Montagu, Y. van Dijk, J. Klepsch, P. Ross, A. Luckow, and H.G. Katzgraber). Physical Review Applied, vol. 18, 054045, 2022.
https://doi.org/10.1103/physrevapplied.18.054045
“Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems,” (with D.B.M.M. Fontes and S.H. Homayouni). J. of Combinatorial Optimization, vol. 44, pp. 1284–1322, 2022.
https://doi.org/10.1007/s10878-022-00885-8
“A C++ Application Programming Interface for Co-evolutionary Biased Random-Key Genetic Algorithms for solution and scenario generation,” (with B.B. Oliveira, M.A. Carravilla, and J.F. Oliveira). Optimization Methods and Software, vol. 37, pp. 1065–1086, 2022.
https://doi.org/10.1080/10556788.2021.1884250
“New instances for maximum weight independent set from a vehicle routing application,” (with Y. Dong, A.V. Goldberg, A. Noe, N. Parotsidis, and Q. Spaen). Operations Research Forum, vol. 2, article 48, 2021.
https://doi.org/10.1007/s43069-021-00084-x
“The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications, (with C.E. Andrade, R.F. Toso, and J.F. Gonçalves), European J. of Operational Reseach, vol. 289, pp. 17–30, 2021.
https://doi.org/10.1016/j.ejor.2019.11.037
“A light-touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique,” (with L.P.G. Petroianu, Z.B. Zabinsky, M. Zameer, Yi Chu, M.M. Muteia, A.L. Coelho, Jiarui Wei, T. Purty, A. Draiva, and A. Lopes), International Transactions in Operational Research, vol. 28, pp. 2334–2358, 2021
https://doi.org/10.1111/itor.12867
“The guide to NP-completeness is 40 years old: An homage to David S. Johnson,” (with L.S. Buriol, C. Figueiredo, and E. Uchoa), Pesquisa Operacional. Vol. 40, 2020.
https://doi.org/10.1590/0101-7438.2020.040.00236329
“Near-optimal disjoint-path facility location through set cover by pairs,” (with D.S. Johnson, L.Breslau, I. Diakonikolas, N. Duffield, Y. Gu, M. Hajiaghayi, H. Karloff, and S. Sen), Operations Research, vol. 68, pp. 896–926, 2020.
https://doi.org/10.1287/opre.2019.1956
“Hybrid algorithms for placement of virtual machines across geo-separated data centers,” (with F. Stefanello, V. Aggarwal, and L.S. Buriol), J. of Combinatorial Optimization, vol. 28, pp. 748-793, 2019.
https://doi.org/10.1007/s10878-019-00411-3
“Biased random-key genetic programming,” (with J.F. Gonçalves), Handbook of Heuristics, R. Mart\'i, P.M. Pardalos, and M.G.C. Resende (Eds.), pp. 23–38, Springer, 2018.
https://doi.org/10.1007/978-3-319-07153-4_25-2
“GRASP,” (with P. Festa), Handbook of Heuristics, R. Mart\'i, P.M. Pardalos, and M.G.C. Resende (Eds.), pp. 465–488, Springer, 2018.
“Random-key genetic algorithms,” (with J.F. Gonçalves), Handbook of Heuristics, R. Mart\'i, P.M. Pardalos, and M.G.C. Resende (Eds.), pp. 703–716, Springer, 2018.
https://doi.org/10.1007/978-3-319-07153-4_30-1
“Greedy randomized adaptive search procedures: Advances and extensions,” (with C.C. Ribeiro), Handbook of Metaheuristics, 3nd Edition, M. Gendreau and J.-Y. Potvin (Eds.), pp. 169–220, Springer, 2018.
https://doi.org/10.1007/978-3-319-91086-4_6
“A biased random key genetic algorithm applied to the electric network reconfiguration problem,” (with H. de Faria Jr. and D. Ernst), J. of Heuristics, vol. 23, pp. 533–550, 2017.
https://doi.org/10.1007/s10732-017-9355-8
“A biased random-key genetic algorithm for the tree of hubs location problem,” (with L.S. Pessoa and A.C. Santos), Optimization Letters, vol. 11, pp. 1371–1384, 2017.
https://doi.org/10.1007/s11590-016-1082-9
“A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems,” (with J.S. Brandão, T.F. Noronha, and C.C. Ribeiro), International Transactions in Operational Research, vol. 24, pp. 1061–1077, 2017.
https://doi.org/10.1111/itor.12429
“On the minimization of traffic congestion in road networks with tolls,” (with F. Stefanello, L.S. Buriol, M.J. Hirsch, P.M. Pardalos, T. Querido, and M. Ritt), Annals of Operations Research, vol.249, pp. 119–139, 2017.
https://doi.org/10.1007/s10479-015-1800-1
“A biased random key genetic algorithm for the field technician scheduling problem,” (with R.B. Damm and D.P. Ronconi), Computers & Operations Research, vol. 75, pp. 49–63, 2016.
https://doi.org/10.1016/j.cor.2016.05.003
“Heuristics for a hub location-routing problem,” (with M.C. Lopes, C.E. Andrade, T.A. Queiroz, and F.K. Miyazawa), Networks, vol. 68, pp. 54–90, 2016.
https://doi.org/10.1002/net.21685
“Hybrid method with CS and BRKGA applied to the minimization of tool switches problem,” (with A.A. Chaves, L.A.N. Lorena, and E.L.F. Senne), Computers & Operations Research, vol. 67, pp. 174–183, 2016.
https://doi.org/10.1016/j.cor.2015.10.009
“A biased random-key genetic algorithm for the minimization of open stacks problem,” (with J.F. Gonçalves and M.D. Costa), International Transactions in Operational Research, vol. 23, pp. 25–46, 2016.
https://doi.org/10.1111/itor.12109
“Hybridizations of GRASP with path-relinking for the far from most problem,” (with D. Ferone and P. Festa), International Transactions in Operational Research, vol. 23, pp. 481–506, 2016.
https://doi.org/10.1111/itor.12167
“A biased random-key genetic algorithm for single-round divisible load scheduling,” (with J.S. Brandão, T.F. Noronha, and C.C. Ribeiro), International Transactions in Operational Research, vol. 22, pp. 823–839, 2015.
https://doi.org/10.1111/itor.12178
“A biased random-key genetic algorithm for wireless backhaul network design,” (with C.E. Andrade, W. Zhang, R.K. Sinha, K.C. Reichmann, R.D. Doverspike, and F.K. Miyazawa), Applied Soft Computing, vol. 33, pp. 150–169, 2015.
https://doi.org/10.1016/j.asoc.2015.04.016
“A biased random-key genetic algorithm for the capacitated minimum spanning tree problem,” (with E. Ruiz, M. Albareda-Sambola, and E. Fernández), Computers & Operations Research, vol. 57, pp. 95-108, 2015.
https://doi.org/10.1016/j.cor.2014.11.011
“A biased random-key genetic algorithm for the unequal area facility layout problem,” (with J.F. Gonçalves), European J. of Operational Research, vol. 246, pp. 86–107, 2015.
https://doi.org/10.1016/j.ejor.2015.04.029
“Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization,” (with A. Duarte, J. Sánchez-Oro, M.G.C. Resende, F. Glover, and R. Mart\'i), Information Systems, vol. 296, pp. 40–60, 2015.
https://doi.org/10.1016/j.ins.2014.10.010
“Biased random-key genetic algorithms for the winner determination problem in combinatorial auctions,” (with C.E. de Andrade, R.F. Toso, and F.K. Miyazawa), Evolutionary Computation, vol. 23, pp. 279–307, 2015.
https://doi.org/10.1162/evco_a_00138
“Multiobjective GRASP with path relinking,” (with R. Mart\'i, V. Campos, and A. Duarte), European J. of Operational Research, vol. 240, pp. 54–71, 2015.
https://doi.org/10.1016/j.ejor.2014.06.042
“A C++ application programming interface for biased random-key genetic algorithms,” (with R.F. Toso), Optimization Methods and Software, vol. 30, pp. 81-93, 2015.
https://doi.org/10.1080/10556788.2014.890197
“A Python/C++ library for bound-constrained global optimization using biased random-key genetic algorithm,” (with R.M.A. Silva, and P.M. Pardalos), J. of Combinatorial Optimization, vol. 30, pp. 710–728, 2015.
https://doi.org/10.1007/s10878-013-9659-z
“An experimental comparison of biased and unbiased random-key genetic algorithms,” (with J.F. Gonçalves and R.F. Toso), Pesquisa Operacional, vol. 34., pp. 143–164, 2014.
https://doi.org/10.1590/0101-7438.2014.034.02.0143
“Improved heuristics for the regenerator location problem,” (with A. Duarte, R. Mart\'i, and R.M.A. Silva), International Transactions in Operational Research, vol. 21, pp. 541–558, 2014.
https://doi.org/10.1111/itor.12085
“An edge-swap heuristic for generating spanning trees with minimum number of branch vertices,” (with R.M.A. Silva, D.M. Silva, G.R. Mateus, J.F. Gonçalves, and P. Festa), Optimization Letters, vol. 8., pp. 1225–1243, 2014.
https://doi.org/10.1007/s11590-013-0665-y
“An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling,” (with J.F. Gonçalves), International Transactions in Operational Research, vol. 21, pp. 215–246, 2014.
https://doi.org/10.1111/itor.12044
“On the improvement of blood sample collection at clinical laboratories,” (with H.R. Lourenço, L.S. Pessoa, A. Grasas, I. Caballé, and N. Barba), BMC Health Services Research, vol.14, article 12, 2014.
https://doi.org/10.1186/1472-6963-14-12
“Randomized heuristics for the family traveling salesperson problem,” (with L.F. Morán-Mirabal and J.L. González-Velarde), International Transactions in Operational Research, vol. 21, pp. 41–57, 2014.
https://doi.org/10.1111/itor.12026
“GRASP: Greedy Randomized Adaptive Search Procedures,” (with C.C. Ribeiro), in Search Methodologies, 2nd edition, E. Burke and G. Kendall (Eds.), Chapter 11, pp. 287-312, Springer, 2014.
https://doi.org/10.4114/ia.v7i19.716
“Finding multiple roots of box-constrained system of nonlinear equations with a biased random-key genetic algorithm,” (with R.M.A. Silva and P.M. Pardalos), J. of Global Optimization, vol. 60, pp. 289–306, 2014.
https://doi.org/10.1007/s10898-013-0105-7
“A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering,” (with L.S. Pessoa and C.C. Ribeiro), Computers & Operations Research, vol. 40, pp. 3132–3146, 2013.
https://doi.org/10.1016/j.cor.2011.11.018
“A Python/C library for bound-constrained global optimization with continuous GRASP,” (with R.M.A. Silva, P.M. Pardalos, and M.J. Hirsch), Optimization Letters, vol. 7, pp. 967–984, 2013.
https://doi.org/10.1007/s11590-012-0475-7
“Design and optimization of fiber-optic small-cell backhaul based on an existing fiber-to-the-node residential access network,” (with C. Ranaweera, K.C. Reichmann, P.P. Iannone, P.S. Henry, B-J. Kim, P.D. Magill, K.N. Oikonomou, R.K. Sinha, and S.L. Woodward), IEEE Communications Magazine, vol. 51(9), pp. 62–69, 2013.
https://doi.org/10.1109/mcom.2013.6588652
“GRASP with path-relinking for facility layout,” (with R.M.A. Silva, P.M. Pardalos, G.R. Mateus, and G. de Tomi), in Models, Algorithms, and Technologies for Network Analysis, B.I. Goldengorin, V.A. Kalyagin, and P.M. Pardalos (Eds.), Springer Proceedings in Mathematics & Statistics, vol. 59, pp. 175–190, Springer, 2013.
https://doi.org/10.1007/978-1-4614-8588-9_11
“A biased random-key genetic algorithm for a 2D and 3D bin packing problem,” (with J.F. Gonçalves), International J. of Production Economics, vol. 145, pp. 500-510, 2013.
https://doi.org/10.1016/j.ijpe.2013.04.019
“Randomized heuristics for handover minimization in mobility networks,” (with L.F. Morán-Mirabal, J.L. González-Velarde, and R.M.A. Silva), J. of Heuristics, vol. 19, pp. 845–880, 2013.
https://doi.org/10.1007/s10732-013-9223-0
“Hybrid metaheuristics for the far from most string problem,” (with D. Ferone and P. Festa), in Hybrid Metaheuristics (HM 2013), Ischia, M.J. Blesa et al., (Eds.), Lecture Notes in Computer Science, vol. 7919, pp. 174–188, 2013.
https://doi.org/10.1007/978-3-642-38516-2_14
“Automatic tuning of GRASP with evolutionary path-relinking,” (with L.F. Morán-Mirabal and J.L. González-Velarde), in Hybrid Metaheuristics (HM 2013), Ischia, M.J. Blesa et al., (Eds.), Lecture Notes in Computer Science, vol. 7919, pp. 62–77, 2013.
https://doi.org/10.1007/978-3-642-38516-2_6
“GRASP: Procedimentos de busca gulosos, aleatórios e adaptativos,” (with R.M.A. Silva), in Meta-Heur\'isticas em Pesquisa Operacional, H.S. Lopes, L.C.A. Rodrigues, and M.T.A. Steiner (Eds.), Chapter 1, pp. 1–20, Omnipax Editora, Curitiba, 2013.
https://doi.org/10.7436/2013.mhpo.01
“A survey of multi-start methods for combinatorial optimization,” (with R. Mart\'i and C.C. Ribeiro), European J. of Operational Research, vol. 226, pp. 1–8, 2013.
https://doi.org/10.1016/j.ejor.2012.10.012
“Hybridizations of GRASP with path-relinking,” (with P. Festa), in Hybrid Metaheuristics, E-G. Talbi, Editor, Studies in Computational Intelligence, vol. 434, pp. 135-155, Springer, 2013.
https://doi.org/10.1007/978-3-642-30671-6_5
“Parallel hybrid heuristics for the permutation flow shop problem,” (with M.G. Ravetti, C. Riveros, A. Mendes, and P.M. Pardalos), Annals of Operations Research, vol. 199, pp. 269-284, 2013.
https://doi.org/10.1007/s10479-011-1056-3
“GRASP: Busca gulosa, aleatorizada e adaptativa,” (with G.R. Mateus and R. M. A. Silva), in Manual de computação evolutiva e metaheur\'istica, A. Gaspar-Cunha, R. Takahashi, and C.H. Antunes (Eds.), pp. 201–213, Coimbra University Press, 2012.
https://doi.org/10.14195/978-989-26-0583-8_9
“Path-relinking intensification methods for stochastic local search algorithms,” (with C. C. Ribeiro), J. of Heuristics, vol. 18, pp. 193–214, 2012.
https://doi.org/10.1007/s10732-011-9167-1
“Biased random-key genetic algorithms with applications in telecommunications,” TOP, vol. 20, pp. 120-153, 2012.
https://doi.org/10.1007/s11750-011-0176-x
“A biased random-key genetic algorithm for the Steiner triple covering problem,” (with R.F. Toso, J.F. Gonçalves, and R.M.A. Silva), Optimization Letters, vol. 6, pp. 605-619, 2012.
https://doi.org/10.1007/s11590-011-0285-3
“Fast local search for the maximum independent set problem,” (with D.V. Andrade and R.F. Werneck), J. of Heuristics, vol. 18, pp. 525–547, 2012.
https://doi.org/10.1007/s10732-012-9196-4
“A parallel multi-population biased random-key genetic algorithm for a container loading problem,” (with J.F. Gonçalves), Computers & Operations Research, vol. 12, pp. 179–190, 2012.
https://doi.org/10.1016/j.cor.2011.03.009
“Revised GRASP with path-relinking for the linear ordering problem,” (with W.A. Chaovalitwongse, P.M. Pardalos, and D.A. Grundel), J. of Combinatorial Optimization, vol. 22, pp. 572–593, 2011.
https://doi.org/10.1007/s10878-010-9306-x
“A biased random-key genetic algorithm for routing and wavelength assignment,” (with T. F. Noronha and C.C. Ribeiro), J. of Global Optimization, vol. 50, pp. 503–518, 2011.
https://doi.org/10.1007/s10898-010-9608-7
“A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion,” (with R. Reis, M. Ritt, and L.S. Buriol), International Transactions in Operational Research, vol. 18, pp. 401–423, 2011.
https://doi.org/10.1111/j.1475-3995.2010.00771.x
“GRASP with path-relinking for data clustering: a case study for biological data,” (with R.M.D. Frinhani, R.M.A. Silva, G.R. Mateus, and P. Festa), Experimental Algorithms, Proceedings of the 10th International Symposium (SEA 2011), Lecture Notes in Computer Science, vol. 6630, pp. 410–420, 2011.
https://doi.org/10.1007/978-3-642-20662-7_35
“An iterative refinement algorithm for the minimum branch vertices problem,” (with D.M. Silva, R.M.A. Silva, G.R. Mateus, J.F. Gonçalves, and P. Festa), Experimental Algorithms, Proceedings of the 10th International Symposium (SEA 2011), Lecture Notes in Computer Science, vol. 6630, pp. 421–433, 2011.
https://doi.org/10.1007/978-3-642-20662-7_36
“A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem,” (with J.F. Gonçalves and J.J.M. Mendes), J. of Heuristics, vol.17, pp. 467–486, 2011.
https://doi.org/10.1007/s10732-010-9142-2
“Biased random-key genetic algorithms for combinatorial optimization,” (with J.F. Gonçalves), J. of Heuristics, vol. 17, pp. 487–525, 2011.
https://doi.org/10.1007/s10732-010-9143-1
“GRASP with path-relinking for the generalized quadratic assignment problem,” (with G.R. Mateus and R.M.A. Silva), J. of Heuristics, vol.17, pp. 527–565, 2011.
https://doi.org/10.1007/s10732-010-9144-0
“GRASP with path relinking heuristics for the antibandwidth problem,” (with A. Duarte, R. Mart\'i, and R.M.A. Silva), Networks, vol. 58, pp. 171–189, 2011.
https://doi.org/10.1002/net.20418
“A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem,” (with J.F. Gonçalves), J. of Combinatorial Optimization, vol. 22, pp. 180–201, 2011.
https://doi.org/10.1007/s10878-009-9282-1
“Correspondence of projected 3D points and lines using a continuous GRASP,” (with M.J. Hirsch and P.M. Pardalos), International Transactions in Operational Research, vol. 18, pp. 493–511, 2011.
https://doi.org/10.1111/j.1475-3995.2011.00810.x
“Restart strategies for GRASP with path-relinking heuristics,” (with C.C. Ribeiro), Optimization Letters, vol. 5, pp. 467–478, 2011.
https://doi.org/10.1007/s11590-011-0322-2
“Experiments with LAGRASP heuristic for set k-covering,” (with L.S. Pessoa and C.C. Ribeiro), Optimization Letters, vol. 5, pp. 407–419, 2011.
https://doi.org/10.1007/s11590-011-0312-4
“GRASP: Greedy randomized adaptive search procedures,” (with R.M.A. Silva), Encyclopedia of Operations Research and Management Sciences, J.J. Cochran, L.A. Cox, Jr., P. Keskinocak, J.P. Kharoufeh, and J.C. Smith (Eds.), vol. 3, pp. 2118–2128, Wiley, 2011.
https://doi.org/10.4114/ia.v7i19.716
“Effective application of GRASP,” (with P. Festa), Encyclopedia of Operations Research and Management Sciences, J.J. Cochran, L.A. Cox, Jr., P. Keskinocak, J.P. Kharoufeh, and J.C. Smith (Eds.), vol. 3, pp. 1609–1617, Wiley, 2011.
https://doi.org/10.1002/9780470400531.eorms0281
“GRASP: Basic components and enhancements,” (with P. Festa), Telecommunication Systems, vol. 46, pp. 253–271, 2011.
https://doi.org/10.1007/s11235-010-9289-z
“A biased random-key genetic algorithm for road congestion minimization,” (with L.S. Buriol, M.J. Hirsch, T. Querido, P.M. Pardalos, and M. Ritt), Optimization Letters, vol. 4, pp. 619–633, 2010.
https://doi.org/10.1007/s11590-010-0226-6
“Hybrid GRASP heuristics,” (with P. Festa), in Foundations of Computational Intelligence," A. Abraham, A.-E. Hassanien, P. Siarry, and A. Engelbrecht (Eds.), vol. 3, pp. 75-100, Springer, New York, 2010
https://doi.org/10.1007/978-3-642-01085-9_4
“Speeding up continuous GRASP,” (with M. J. Hirsch and P. M. Pardalos), European J. of Operational Research, vol. 205, pp. 507–521, 2010.
https://doi.org/10.1016/j.ejor.2010.02.009
“Scatter search and path-relinking: Fundamentals, advances, and applications,” (with C.C. Ribeiro, R. Mart\'i, and F. Glover), Handbook of Metaheuristics, 2nd Edition, M. Gendreau and J.-Y. Potvin (Eds.), Springer, pp. 87-107, 2010.
https://doi.org/10.1007/978-1-4419-1665-5_4
“Greedy randomized adaptive search procedures: Advances and applications,” (with C.C. Ribeiro), Handbook of Metaheuristics, 2nd Edition, M. Gendreau and J.-Y. Potvin (Eds.), Springer, pp. 281–317, 2010.
“Solving multi-objective network flow problems with an interior point method,” (with M. Fonseca and J.R. Figueira), International Transactions in Operational Research, vol. 17, pp. 607–636, 2010.
https://doi.org/10.1111/j.1475-3995.2010.00761.x
“Automatic tuning of GRASP with path-relinking heuristics with a biased random-key genetic algorithm,” (with P. Festa, J.F. Gonçalves, and R.M.A. Silva), in Experimental Algorithms, P. Festa (ed.), Lecture Notes in Computer Science, vol. 6049, pp. 338–349, 2010.
https://doi.org/10.1007/978-3-642-13193-6_29
“GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem,” (with M.C.V. Nascimento and F.M.B. Toledo), European J. of Operational Research, vol. 200, pp. 747–754, 2010.
https://doi.org/10.1016/j.ejor.2009.01.047
“GRASP and path relinking for the max-min diversity problem,” (with R. Mart\'i, M. Gallego, and A. Duarte), Computers & Operations Research, vol. 37, pp. 498–508, 2010.
https://doi.org/10.1016/j.cor.2008.05.011
“Continuous GRASP with a local active-set method for bound-constrained global optimization,” (with E.G. Birgin, E.M. Gozzi, and R.M.A. Silva), J. of Global Optimization, vol. 48, pp. 289–310, 2010.
https://doi.org/10.1007/s10898-009-9494-z
“Solving systems of nonlinear equations with continuous GRASP,” (with M. J. Hirsch and and P. M. Pardalos), Nonlinear Analysis: Real World Applications, vol. 10, pp. 2000–2006, 2009.
https://doi.org/10.1016/j.nonrwa.2008.03.006
“An annotated bibliography of GRASP, Part I: Algorithms,” (with P. Festa), International Transactions in Operational Research, vol. 16, pp. 1–24, 2009.
https://doi.org/10.1111/j.1475-3995.2009.00663.x
“An annotated bibliography of GRASP, Part II: Applications,” (with P. Festa), International Transactions in Operational Research, vol. 16, pp. 131–172, 2009.
https://doi.org/10.1111/j.1475-3995.2009.00664.x
“A random key based genetic algorithm for the resource constrained project scheduling problem,” (with J.J.M. Mendes and J.F. Gonçalves), Computers & Operations Research, vol. 36, pp. 92–109, 2009.
https://doi.org/10.1016/j.cor.2007.07.001
“A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs,” (with A.S. da Cunha, A. Lucena, and N. Maculan), Discrete Applied Mathematics, vol. 157, pp. 1198–1217, 2009.
https://doi.org/10.1016/j.dam.2008.02.014
“Metaheuristic hybridization with greedy randomized adaptive procedures,” in TutORials in Operations Research, Z.-L. Chen and S. Raghavan (Eds.), INFORMS, pp. 295–319, 2008.
https://doi.org/10.1287/educ.1080.0045
“Fortran subroutines for network flow optimization using an interior point algorithm,” (with J. Patr\'icio, L. F. Portugal, G. Veiga, and J. J. Júdice), Pesquisa Operacional, vol. 28, pages 243–261, 2008.
https://doi.org/10.1590/s0101-74382008000200005
“Fast local search for the maximum independent set problem,” (with D.V. Andrade and R.F. Werneck), in Proceedings of 7th International Workshop on Experimental Algorithms (WEA 2008), C.C. McGeoch (Ed.), Lecture Notes in Computer Science, Springer, vol. 5038, pp. 220-234, 2008.
https://doi.org/10.1007/978-3-540-68552-4_17
“Efficient implementations of heuristics for routing and wavelength assignment.” (with T.F. Noronha and C.C. Ribeiro), in Proceedings of 7th International Workshop on Experimental Algorithms (WEA 2008), C.C. McGeoch (Ed.), Lecture Notes in Computer Science, Springer, vol. 5038, pp. 169–180, 2008.
https://doi.org/10.1007/978-3-540-68552-4_13
“GRASP with path-relinking for the cooperative communication problem in ad hoc networks,” (with C. Commander, P. Festa, C.A.S. Oliveira, P.M. Pardalos, M. Tsitselis), in Cooperative Networks: Control and Optimization, D.A. Grundel, R.A. Murphey, P.M. Pardalos, and O.A. Prokopyev (Eds.), Edward Elgar Publishing, Chapter 10, 2008
https://doi.org/10.4337/9781035305520.00015
“A continuous GRASP to determine the relationship between drugs and adverse reactions,” (with M. J. Hirsch, C.N. Meneses, M.A. Ragle, and P. M. Pardalos), in Data Mining, Systems Analysis and Optimization in Biomedicine, O. Seref, O. Erhun Kundakcioglu, and P.M. Pardalos (Eds.), AIP Conference Proceedings, vol. 953, pp. 106–121, Springer, 2008.
https://doi.org/10.1063/1.2817334
“Speeding up dynamic shortest path algorithms,” (with L.S. Buriol, and M. Thorup), INFORMS J. on Computing, vol. 20, No. 2, pp. 191–204, 2008.
https://doi.org/10.1287/ijoc.1070.0231
“A genetic algorithm for the resource constrained multi-project scheduling problem,” (with J.F. Gonçalves and J.J.M. Mendes) European J. of Operational Research, vol. 189, pp. 1171–1190, 2008.
https://doi.org/10.1016/j.ejor.2006.06.074
“Streaming cache placement problems: Complexity and algorithms,” (with C.A.S. Oliveira, P.M. Pardalos, and O. Prokopyev), International J. of Computational Science and Engineering, vol. 3, pp. 173–183, 2007.
https://doi.org/10.1504/ijcse.2007.017823
“An optimizer in the telecommunications industry,” SIAM SIAG/Optimization Views-and-News, vol. 18, no. 2, pp. 8–19, 2007.
“TIE Breaking: Tunable Interdomain Egress Selection,” (with R. Teixeira, T.G. Griffin, and J. Rexford), IEEE/ACM Transactions on Networking, vol. 15, issue 4, pp. 761–774, 2007.
https://doi.org/10.1109/tnet.2007.893877
“A fast swap-based local search procedure for location problems,” (with R.F. Werneck), Annals of Operations Research, vol. 150, pp. 205–230, 2007.
https://doi.org/10.1007/s10479-006-0154-0
“Global optimization by continuous GRASP,” (with M.J. Hirsch, C.N. Meneses, and P.M. Pardalos), Optimization Letters, vol. 1, no. 2, pp. 201–212, 2007.
https://doi.org/10.1007/s11590-006-0021-6
“Survivable IP network design with OSPF routing,” (with L.S. Buriol, and M. Thorup), Networks, vol. 49, pp. 51–64, 2007.
https://doi.org/10.1002/net.20141
C.W. Commander, C.A.S. Oliveira, P.M. Pardalos, and M.G.C. Resende. “A one-pass heuristic for cooperative communication in mobile ad hoc networks,” in Cooperative Systems: Control and Optimization, D.A. Grundel, R.A. Murphey, P.M. Pardalos, and O.A. Prokopyev (Eds.), pp. 285-296, Springer, 2007.
https://doi.org/10.1007/978-3-540-48271-0_17
“TTTPLOTS: A perl program to create time-to-target plots,” (with R.M. Aiex and C.C. Ribeiro), Optimization Letters, vol. 1, pp. 355–366, 2007.
https://doi.org/10.1007/s11590-006-0031-4
“GRASP with path-relinking for the weighted MAXSAT problem,” (with P. Festa, P.M. Pardalos, and L.S. Pitsoulis) ACM J. of Experimental Algorithmics, vol. 11, article 2.4, pp. 1–16, 2006.
https://doi.org/10.1145/1187436.1216581
“A hybrid multistart heuristic for the uncapacitated facility location problem,” (with R.F. Werneck), European J. of Operational Research, vol. 174, pp. 54-68, 2006.
https://doi.org/10.1016/j.ejor.2005.02.046
“Optimization problems in multicast tree construction,” (with C.A.S. Oliveira and P.M. Pardalos), in Handbook of Optimization in Telecommunication, M.G.C. Resende and P.M. Pardalos, eds., pp. 701–731, Springer, 2006.
https://doi.org/10.1007/978-0-387-30165-5_25
“Parallel Greedy Randomized Adaptive Search Procedures,” (with C.C. Ribeiro), in Parallel Metaheuristics: A new class of algorithms, E. Alba (Ed.), Wiley, pp. 315–346, 2005.
https://doi.org/10.1002/0471739383.ch14
“A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing,” (with L.S. Buriol, C.C. Ribeiro, and M. Thorup), Networks, vol. 46, no. 1, pp. 36–56, 2005.
https://doi.org/10.1002/net.20070
“GRASP with path relinking for three-index assignment,” (with R.M. Aiex, P.M. Pardalos, and G. Toraldo), INFORMS J. on Computing, vol. 17, no. 2, pp. 224–247, 2005.
https://doi.org/10.1287/ijoc.1030.0059
“GRASP with path-relinking for the weighted maximum satisfiability problem,” (with P. Festa, P.M. Pardalos, and L.S. Pitsoulis) in WEA2005, S.E. Nikoletseas (Ed.), Lecture Notes in Computer Science, vol. 3503, pp. 367–379, 2005.
https://doi.org/10.1007/11427186_32
“Parallel strategies for GRASP with path-relinking,” (with R.M. Aiex), in Metaheuristics: Progress as Real Problem Solvers, T. Ibaraki, K. Nonobe and M. Yagiura, (Eds.), Springer, pp. 301–331, 2005.
https://doi.org/10.1007/0-387-25383-1_14
“GRASP with path-relinking: Recent advances and applications,” (with C.C. Ribeiro), in Metaheuristics: Progress as Real Problem Solvers, T. Ibaraki, K. Nonobe and M. Yagiura, (Eds.), Springer, pp. 29–63, 2005.
https://doi.org/10.1007/0-387-25383-1_2
“A hybrid genetic algorithm for the job shop scheduling problem,” (with J.F. Gonçalves and J.J.M. Mendes), European J. of Operational Research, vol. 167, pp. 77–95, 2005.
“Transmission network design by a greedy randomized adaptive path relinking approach,” (with H. Faria Jr., S. Binato and D.J. Falcão), IEEE Transactions on Power Systems, vol. 20, pp. 43–49, 2005.
https://doi.org/10.1109/tpwrs.2004.835627
“An evolutionary algorithm for manufacturing cell formation,” (with J.F. Gonçalves), Computers & Industrial Engineering, vol. 47, pp. 247–273, 2004.
https://doi.org/10.1016/j.cie.2004.07.003
“Strong lower bounds for the prize collecting Steiner tree problem in graphs,” (with A. Lucena), Discrete Applied Mathematics, vol. 141, pp. 277–294, 2004.
https://doi.org/10.1016/s0166-218x(03)00380-9
“GRASP with path-relinking for the quadratic assignment problem,” (with C.A.S. Oliveira and P.M. Pardalos), Lecture Notes in Computer Science, vol. 3059, pp. 356–368, 2004.
https://doi.org/10.1007/978-3-540-24838-5_27
“A hybrid heuristic for the p-median problem,” (with R.F. Werneck), J. of Heuristics, vol. 10, pp. 59–88, 2004.
https://doi.org/10.1023/b:heur.0000019986.96257.50
“GRASP: Procedimientos de búsqueda miope aleatorizado y adaptativo,” (with J.L. Gonzalez Velarde), Inteligencia Artificial, Spanish Association for Artificial Intelligence (AEPIA), no. 19, vol. 2, pp. 61–76, 2003.
“An annotated bibliography of network interior point methods,” (with G. Veiga), Networks, vol. 42, pp. 114–121, 2003.
https://doi.org/10.1002/net.10087
“Combinatorial optimization in telecommunications,” in Optimization and Industry: New Frontiers, P.M. Pardalos and V. Korotkich, eds., Kluwer Academic Publishers, pp. 59–112, 2003.
https://doi.org/10.1007/978-1-4613-0233-9_4
“Parallel GRASP with path-relinking for job shop scheduling,” (with R.M. Aiex and S. Binato), Parallel Computing, vol. 29, pp. 393–430, 2003.
https://doi.org/10.1016/s0167-8191(03)00014-0
“A GRASP with path-relinking for private virtual circuit routing,” (with C.C. Ribeiro), Networks, vol. 41, no. 1, pp. 104–114, 2003.
https://doi.org/10.1002/net.10065
“A study of preconditioners for network interior point methods,” (with J.J. Júdice, J.M. Patr\'icio, L.F. Portugal, and G. Veiga), Computational Optimization and Applications, vol. 24, pp. 5–35, 2003.
https://doi.org/10.1023/a:1021882330897
“Greedy randomized adaptive search procedures,” (with C.C. Ribeiro), in Handbook of Metaheuristics, F. Glover and G. Kochenberger, eds., Kluwer Academic Publishers, pp. 219–249, 2003.
“Randomized heuristics for the MAX-CUT problem,” (with P. Festa, P.M. Pardalos, and C.C. Ribeiro), Optimization Methods & Software, vol. 7, pp. 1033–1058, 2002.
https://doi.org/10.1080/1055678021000090033
“Parallel metaheuristics for combinatorial optimization,” (with S. Duni Ek\~glu and P.M. Pardalos), in Models for Parallel and Distributed Computation– Theory, Algorithmic Techniques and Applications, R. Corrêa, I. Dutra, M. Fiallos, and F. Gomes (Eds.), Kluwer Academic Publishers, pp. 179–206, 2002.
https://doi.org/10.1007/978-1-4757-3609-0_7
“Probability distribution of solution time in GRASP: An experimental investigation,” (with R.M. Aiex, and C.C. Ribeiro), J. of Heuristics, vol. 8, pp. 343–373, 2002.
https://doi.org/10.1023/a:1015061802659
“A combinatorial approach to piecewise linear time series analysis, (with M.C. Medeiros and A. Veiga), J. of Computational and Graphical Statistics, vol. 11, pp. 236-258, 2002.
https://doi.org/10.1198/106186002317375712
“Massive quasi-clique detection,” (with J. Abello and S. Sudarsky), in LATIN 2002: Theoretical Informatics, S. Rajsbaum (Ed.), Lecture Notes in Computer Science, vol. 2286, pp. 598–612, Springer-Verlag, 2002.
https://doi.org/10.1007/3-540-45995-2_51
“Tight QAP bounds via linear programming,” (with K.G. Ramakrishnan, B. Ramachandran, and J.F. Pekny), in Combinatorial and Global Optimization, P.M. Pardalos, A. Migdalas, and R.E. Burkard (Eds.), World Scientific Publishing Co., Singapore, pp. 297–303, 2002.
https://doi.org/10.1142/9789812778215_0019
“A genetic algorithm for the weight setting problem in OSPF routing,” (with M. Ericsson and P.M. Pardalos), J. of Combinatorial Optimization, vol. 6, pp. 299–333, 2002.
https://doi.org/10.1023/a:1014852026591
“Greedy randomized adaptive search procedures,” (with L.S. Pitsoulis), in Handbook of Applied Optimization, P.M. Pardalos and M.G.C. Resende, (Eds.), Oxford University Press, pp. 168–183, 2002.
“Introduction to the Handbook of Applied Optimization,” (with P.M. Pardalos), in Handbook of Applied Optimization, P.M. Pardalos and M.G.C. Resende, (Eds.), Oxford University Press, pp. xv–xviii, 2002.
“Introduction to Combinatorial Optimization,” (with P.M. Pardalos), in Handbook of Applied Optimization, P.M. Pardalos and M.G.C. Resende, (Eds.), Oxford University Press, pp. 51–53, 2002.
“GRASP: An annotated bibliography,” (with P. Festa), in Essays and Surveys on Metaheuristics, C.C. Ribeiro and P. Hansen, Eds., Kluwer Academic Publishers, pp. 325–367, 2002.
https://doi.org/10.1007/978-1-4615-1507-4_15
“A GRASP for job shop scheduling,” (with S. Binato, W.J. Hery, and D.M. Loewenstern), in Essays and Surveys on Metaheuristics, C.C. Ribeiro and P. Hansen, Eds., Kluwer Academic Publishers, pp. 58–79, 2002.
https://doi.org/10.1007/978-1-4615-1507-4_3
“Algorithm 815: FORTRAN subroutines for approximate solution of feedback set problems using GRASP,” (with P. Festa and P.M. Pardalos), ACM Transactions on Mathematical Software, vol. 27, pp. 456–464, 2001.
“Feedback set problems, (with P. Festa and P.M. Pardalos), Encyclopedia of Optimization, vol. 2, pp. 94–106, Kluwer Academic Publishers, 2001.
https://doi.org/10.1007/978-0-387-74759-0_178
“Graph planarization, (with C.C. Ribeiro), Encyclopedia of Optimization, vol. 2, pp. 368–373, Kluwer Academic Publishers, 2001.
“Greedy randomized adaptive search procedures (GRASP), Encyclopedia of Optimization, vol. 2, pp. 373–382, Kluwer Academic Publishers, 2001.
“Finding independent sets in a graph using continuous multivariable polynomial formulations,” (with J. Abello, S. Butenko, and P.M. Pardalos), J. of Global Optimization, vol. 21, pp. 111–137, 2001.
https://doi.org/10.1023/a:1011968411281
“Local search with perturbations for the prize-collecting Steiner tree problem in graphs,” (with S.A. Canuto and C.C. Ribeiro), Networks, vol. 38, pp. 50–58, 2001.
https://doi.org/10.1002/net.1023
“ Piecewise linear time series estimation with GRASP, (with M.C. Medeiros and A. Veiga), Computational Optimization and Applications, Vol. 19, pp. 127–144, 2001.
https://doi.org/10.1023/a:1011238718363
“A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy,” (with S.L. Martins, C.C. Ribeiro, and P.M. Pardalos), J. of Global Optimization, Vol. 17, pp. 267–283, 2000.
https://doi.org/10.1023/a:1026546708757
“A GRASP for frequency assignment in mobile radio networks,” (with X. Liu, P.M. Pardalos, and S. Rajasekaran), in Mobile Networks and Computing, S. Rajasekaran, P.M. Pardalos, and F. Hsu, Eds., DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 52, pp. 195–201, American Mathematical Society, 2000.
https://doi.org/10.1090/dimacs/052/12
“A truncated primal-infeasible dual-feasible interior point network flow method,” (with L.F. Portugal, G. Veiga and J.J. Júdice), Networks, vol. 35, pp. 91–108, 2000.
https://doi.org/10.1002/(sici)1097-0037(200003)35:2<91::aid-net1>3.0.co;2-t
“FORTRAN subroutines for computing approximate solutions of MAX-SAT problems using GRASP,” (with L.S. Pitsoulis and P.M. Pardalos), Discrete Applied Mathematics, vol. 100, pp. 95–113, 2000.
https://doi.org/10.1016/s0166-218x(99)00171-7
“Feedback set problems, (with P. Festa and P.M. Pardalos), in Handbook of Combinatorial Optimization, D.-Z. Du and P.M. Pardalos (Eds.), Kluwer Academic Publishers, Supplement vol. A, pp. 209–259, 1999.
“On maximum clique problems in very large graphs, (with J. Abello and P.M. Pardalos), in External Memory Algorithms, J. Abello and J. Vitter, Eds., DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 50, pp. 119-130, American Mathematical Society, 1999.
https://doi.org/10.1090/dimacs/050/06
“Frequency assignment problems, (with R.A. Murphey and P.M. Pardalos), in Handbook of Combinatorial Optimization, D.-Z. Du and P.M. Pardalos (Eds.), Kluwer Academic Publishers, Supplement vol. A, pp. 295–377, 1999.
https://doi.org/10.1007/978-1-4757-3023-4_6
“Greedy randomized adaptive search procedures for the Steiner problem in graphs,” (with S.L. Martins, P.M. Pardalos, and C.C. Ribeiro), in Randomization Methods in Algorithm Design, P.M. Pardalos, S. Rajasekaran, and J. Rolin, Eds., DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 43, pp. 133–145, 1999.
https://doi.org/10.1090/dimacs/043/08
“An exact parallel algorithm for the maximum clique problem,” (with P.M. Pardalos and J. Rappe), in High Performance Algorithms and Software in Nonlinear Optimization, R. De Leone et al., (Eds.), Kluwer Academic Publishers, pp. 279–300, 1999.
https://doi.org/10.1007/978-1-4613-3279-4_18
“Algorithm 797: FORTRAN subroutines for approximate solution of graph planarization problems using GRASP,” (with C.C. Ribeiro), ACM Transactions on Mathematical Software, vol. 25, pp. 341–352, 1999.
“A greedy randomized adaptive search procedure for feedback vertex set,” (with P.A. Pardalos and T. Qian), J. of Combinatorial Optimization, vol. 2, no. 4, 399–412, 1999.
https://doi.org/10.1023/a:1009736921890
“Computing approximate solutions of the maximum covering problem using GRASP,” J. of Heuristics, vol. 4, pp. 161–171, 1998.
https://doi.org/10.1023/a:1009677613792
“Interior point methods for combinatorial optimization,” (with J.E. Mitchell and P.M. Pardalos), in Handbook of Combinatorial Optimization, D.-Z. Du and P.M. Pardalos (Eds.), vol. 1, pp. 189–298, Kluwer Academic Publishers, 1998.
https://doi.org/10.1007/978-1-4613-3449-1_11
“A GRASP for the biquadratic assignment problem,” (with T. Mavridou, P.M. Pardalos, and L.S. Pitsoulis), European J. of Operational Research, vol. 105, pp. 613–621, 1998.
https://doi.org/10.1016/s0377-2217(97)00083-0
“Algorithm 786: FORTRAN subroutines for approximate solution of maximum independent set problems using GRASP,” (with T.A. Feo and S.H. Smith), ACM Transactions on Mathematical Software, vol. 24, no. 4, pp. 386–394, 1998.
https://doi.org/10.1145/293686.293690
“Approximate solution of weighted MAX-SAT problems using GRASP,” (with L.S. Pitsoulis and P.M. Pardalos), in The Satisfiability Problem: Theory and Applications, D.-Z. Du, J.~Gu, and P.M.~Pardalos (Eds.), DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 35 pp. 393–405, 1997.
https://doi.org/10.1090/dimacs/035/11
“A GRASP for graph planarization,” (with C.C. Ribeiro), Networks, vol. 29, pp. 173–189, 1997.
https://doi.org/10.1002/(sici)1097-0037(199705)29:3<173::aid-net5>3.3.co;2-y
“Algorithm 769: FORTRAN subroutines for approximate solution of sparse quadratic assignment problems using GRASP,” (with P.M. Pardalos, and L. Pitsoulis), ACM Transactions on Mathematical Software, vol. 23, pp. 196–208, 1997.
https://doi.org/10.1145/225545.225553
“Implementation of a variance reduction based lower bound in a branch and bound algorithm for the quadratic assignment problem,” (with Y. Li, P.M. Pardalos, and K.G. Ramakrishnan), SIAM J. on Optimization, vol. 7, pp. 280–294, 1997.
https://doi.org/10.1137/s1052623494273393
“A GRASP for Satisfiability,” (with T.A. Feo), in Cliques, Coloring, and Satisfiability: 2nd DIMACS Implementation Challenge, David S. Johnson and Michael A. Trick , Eds., DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 499–520, American Mathematical Society, 1996.
https://doi.org/10.1090/dimacs/026/24
“A parallel GRASP for MAX-SAT problems,” (with L.S. Pitsoulis and P.M. Pardalos), Lecture Notes in Computer Science, vol. 1180, pp. 575–585, Springer-Verlag, 1996.
https://doi.org/10.1007/3-540-62095-8_62
“Interior point methods for global optimization,” (with P.M. Pardalos), in Interior point methods in mathematical programming, T. Terlaky, Ed., Kluwer Academic Press, pp. 467–500, 1996.
https://doi.org/10.1007/978-1-4613-3449-1_12
“A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming,” (with K.G. Ramakrishnan and P.M. Pardalos), in State of the Art in Global Optimization: Computational Methods and Applications, C. Floudas and P.M. Pardalos, Eds., pp. 57–73, Kluwer Academic Publishers, 1996.
https://doi.org/10.1007/978-1-4613-3437-8_5
“Interior point algorithms for network flow problems,” (with P.M. Pardalos), in Advances in Linear and Integer Programming, J.E. Beasley, Ed., Oxford University Press, pp. 147–187, 1996.
https://doi.org/10.1093/oso/9780198538561.003.0004
“Algorithm 754: FORTRAN subroutines for approximate solution of dense quadratic assignment problems using GRASP,” (with P.M. Pardalos and Y. Li), ACM Transactions on Mathematical Software, vol. 22, pp.~104–118, 1996.
https://doi.org/10.1145/225545.225553
“Designing and reporting on computational experiments with heuristic methods,” (with R.S. Barr, B.L. Golden, J.P. Kelly, and W.R. Stewart), J. of Heuristics, vol. 1, pp. 9–32, 1995.
https://doi.org/10.1007/bf02430363
“Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming,” (with K.G. Ramakrishnan and Z. Drezner), Operations Research, vol. 43, pp. 781–791, 1995.
https://doi.org/10.1287/opre.43.5.781
“Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP,” (with P.M. Pardalos, L. Pitsoulis, and T. Mavridou), in Parallel Algorithms for Irregularly Structured Problems, Proceedings of the 2nd International Workshop~– Irregular'95, (Lyon, France), A. Ferreira and J. Rolim, Eds., Springer-Verlag, Lecture Notes in Computer Science, Vol. 980, pp. 317-331, 1995.
https://doi.org/10.1007/3-540-60321-2_26
“A parallel GRASP implementation for the quadratic assignment problem,” (with P.M. Pardalos and L.S. Pitsoulis), in Parallel Algorithms for Irregular Problems: State of the Art, A. Ferreira and J. Rolim, Eds., Kluwer Academic Publishers, pages 115–133, 1995.
https://doi.org/10.1007/978-1-4757-6130-6_6
“Greedy randomized adaptive search procedures,” (with T.A. Feo), J. of Global Optimization, vol. 6, pp. 109–133, 1995.
https://doi.org/10.1007/0-387-33416-5_10
“Identifying the optimal face of a network linear program with a globally convergent interior point method,” (with T. Tsuchiya and G. Veiga), in Large Scale Optimization: State of the Art, W.W. Hager, D.W. Hearn and P.M. Pardalos, Eds., Kluwer, pp. 362–387, 1994.
“A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem,” (with Y. Li and P.M. Pardalos), in Quadratic assignment and related problems, P.M. Pardalos and H. Wolkowicz, Eds., DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 237–261, American Mathematical Society, 1994.
https://doi.org/10.1090/dimacs/016/12
“A greedy randomized adaptive search procedure for maximum independent set,” (with T.A. Feo and S.H. Smith), Operations Research, vol. 42, pp. 860–878, 1994.
https://doi.org/10.1287/opre.42.5.860
“Lower bounds for the quadratic assignment problem,” (with Y. Li, P.M. Pardalos, and K.G. Ramakrishnan), Annals of Operations Research, vol. 50, pp. 387–411, 1994.
https://doi.org/10.1007/bf02085649
“An implementation of the dual affine scaling algorithm for minimum cost flow on bipartite uncapacitated networks,” (with G.Veiga), SIAM J. on Optimization, vol. 3, pp. 516–537, 1993.
https://doi.org/10.1137/0803025
“Computing the projection in an interior point algorithm: An experimental comparison,” (with G. Veiga), Investigación Operativa, vol. 3, pp. 81–92, 1993.
“An efficient implementation of a network interior point method,” (with G. Veiga), in Network Flows and Matching: 1st DIMACS Implementation Challenge, D.S. Johnson and C.C. McGeoch, Eds., DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 12, pp. 299–348, American Mathematical Society, 1993.
https://doi.org/10.1090/dimacs/012/12
“A continuous approach to inductive inference,” (with A.P. Kamath, N. Karmarkar, and K.G. Ramakrishnan), Mathematical Programming, vol. 57, pp. 215–238, 1992.
https://doi.org/10.1007/bf01581082
“An interior point algorithm to solve computationally difficult set covering problems,” (with N. Karmarkar and K.G. Ramakrishnan), Mathematical Programming, vol. 52, pp. 597–618, 1991.
https://doi.org/10.1007/bf01582907
“Computational experience with an interior point algorithm on the Satisfiability problem,” (with A.P. Kamath, N. Karmarkar, and K.G. Ramakrishnan), Annals of Operations Research, vol. 25, pp. 43–58, 1990.
https://doi.org/10.1007/bf02283686
“A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension,” (with R.D.C. Monteiro and I. Adler), Mathematics of Operations Research, vol. 15, pp. 191–214, 1990.
https://doi.org/10.1287/moor.15.2.191
“A probabilistic heuristic for a computationally difficult set covering problem,” (with T.A. Feo), Operations Research Letters, vol. 8, pp. 67–71, 1989.
https://doi.org/10.1016/0167-6377(89)90002-3
“Data structures and programming techniques for the implementation of Karmarkar's algorithm,” (with I. Adler, N. Karmarkar, and G. Veiga), ORSA J. on Computing, vol. 1, pp. 84–106, 1989.
https://doi.org/10.1287/ijoc.1.2.84
“An implementation of Karmarkar's algorithm for linear programming,” (with I. Adler, N. Karmarkar, and G. Veiga), Mathematical Programming, vol. 44, pp. 297–335, 1989.
“Closed-loop job release control for VLSI circuit manufacturing,” (with C.R. Glassey), IEEE Transactions on Semiconductor Manufacturing, vol. 1, pp. 36–46, 1988.
https://doi.org/10.1016/0026-2714(89)90463-0
“A scheduling rule for job release in semiconductor fabrication,” (with C.R. Glassey), Operations Research Letters, vol. 7, pp. 213–217, 1988.
https://doi.org/10.1016/0167-6377(88)90033-8
“A computer program for reliability evaluation of large-scale networks via polygon-to-chain reductions,” IEEE Transactions on Reliability, vol. R-35, pp. 24–29, 1986.
“A generation dispatching system for the analysis of transmission and energy interchange in Brazil,” (with R.E. Campello and L.H. Coutinho), Chilean J. of Systems Engineering, vol. 4, pp. 45–68, 1984, in Spanish.
64 entries
“Integer programming formulations for the connected Grundy coloring problem," (with M.C. da Silva, R. Melo, M.C. Santos, and R.F. Toso), in Proceedings of the LVI Brazilian Symposium on Operations Research (SBPO 2024), vol. 56, pp. 309611, 2024.
“Random-key Optimizers – Short course," (with A.A. Chaves and R.M.A. Silva), in Proceedings of the LVI Brazilian Symposium on Operations Research (SBPO 2024), vol. 56, pp. 308635, 2024.
“A continuous-GRASP random-key optimizer,” (with A.A. Chaves and R.M.A. Silva), in 15th Metaheuristics International Conference (MIC2024), Lorient, France, June 2024.
https://doi.org/10.1007/978-3-031-62912-9_3
“Formulações de programação inteira para o problema da coloração de Grundy," (with M. Carvalho, R. Melo, M.C. Santos, and R.F. Toso), in Proceedings of the LV Brazilian Symposium on Operations Research (SBPO 2023), vol. 55, pp. 161002, 2023.
https://doi.org/10.59254/sbpo-2023-175094
“Algoritmos genéticos de chaves aleatórias enviesadas para o problema da coloração de Grundy," (with M. Carvalho, R. Melo, M.C. Santos, and R.F. Toso), in Proceedings of the LV Brazilian Symposium on Operations Research (SBPO 2023), vol. 55, pp. 161001, 2023.
https://doi.org/10.59254/sbpo-2023-175093
“cudaBRKGA-CNN: An approach for optimizing convolutional neural network architectures,” (with A.A. da Silva, R.M.A. Silva, A.S. Xavier, T.D. Bispo, and G.R. Mateus), in IEEE 2023 Congress on Evolutionary Computation (IEEE CEC 2023), Chicago, USA, July 2023.
https://doi.org/10.1109/cec53210.2023.10254101
“A local search algorithm for large maximum weight independent set problems,” (with Y. Dong, A.V. Goldberg, A. Noe, N. Parotsidis, and Q. Spaen), in 30th Annual European Symposium on Algorithms (ESA 2022), S. Chechik, G. Navarro, E. Rotenberg, and G. Herman (eds.), article 45, pp. 45:1–45:16, Leibniz International Proceedings in Informatics SchlossDagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany, 2022.
“A BRKGA with implicit path-relinking for the vehicle routing problem with occasional drivers and time windows,” (with P. Festa, F. Guerriero, and E. Scalzo), in Metaheuristics, Proceedings of MIC 2022, L. Di Gaspero, P. Festa, A. Nakib, and M. Pavone (Eds.), Springer International Publishing, Cham, pp. 17–29, 2023.
https://doi.org/10.1007/978-3-031-26504-4_2
“A distributed solver for large-scale middle-mile routing problems,” (with R. Chen, A. Goldberg, J. Michel, and V. Radhakrishnan), Proceedings of 2019 Amazon Research Science Summit, M.G.C. Resende (ed.), pp. 65–73, Suncadia Resort, Cle Elum, WA, August 26–28, 2019.
“A new local search for the p-center problem based on the critical vertex concept,” (with D. Ferone, P. Festa, A. Napoletano, and M.G.C. Resende), in Learning and Intelligent Optimization (LION 2017), R. Battiti, D. Kvasov, and Y. Sergeyev (eds), Lecture Notes in Computer Science, vol. 10556, pp. 79–92, 2017.
https://doi.org/10.1007/978-3-319-69404-7_6
“Biased random-key genetic algorithms: An advanced tutorial,” (with C.C. Ribeiro), Genetic and Evolutionary Computation Conference (GECCO'16), Denver, U.S.A., July 20–24, pp. 483–514, 2016.
“A biased random-key genetic algorithm for scheduling divisible loads,” (with J.S. Brandão, T.F. Noronha, and C.C.Ribeiro), Proceedings of Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA'15), Prague, Czech Republic, August 25-28, 2015.
“A biased random-key genetic algorithm for placement of virtual machines across geo-separated data centers,” (with F. Stefanello, V. Aggarwal, L.S. Buriol, and J.F. Gonçalves), Genetic and Evolutionary Computation Conference (GECCO'15), Madrid, Spain, July 11-15, pp. 919–926, 2015.
https://doi.org/10.1145/2739480.2754768
“Evolutionary algorithms for overlapping correlation clustering,” (with C.E. Andrade, H.J. Karloff, and F.K. Miyazawa), Genetic and Evolutionary Computation Conference (GECCO'14), Vancouver, Canada, July 12-16, pp. 405–412, 2014.
https://doi.org/10.1145/2576768.2598284
“Introdução aos algoritmos genéticos de chaves aleatórias viciadas,” in Proceedings of the XLV Symposium of the Brazilian Operations Research Society, Natal, September 2013.
“Algoritmo genético de chaves aleatórias viciadas para problemas de otimização global com restrições de caixa sujeitas a restrições não-lineares” (with R.M.A. Silva), in Proceedings of the XLV Symposium of the Brazilian Operations Research Society, Natal, September 2013.
“A biased random-key genetic algorithm for a network pricing problem,” (with F. Stefanello and L.S. Buriol) in Proceedings of the XLV Symposium of the Brazilian Operations Research Society, Natal, September 2013.
“Evolutionary algorithm for the k-interconnected multi-depot mutlti-traveling salesmen problem,” (with C.E. de Andrade and F.K. Miyazawa), Proceedings of the Fifteenth Annual Conference on Genetic and Evolutionary Computation (GECCO'13), pp. 463–470, ACM, New York, 2013.
https://doi.org/10.1145/2463372.2463434
“Biased random-key genetic algorithm for non-linearly constrained global optimization,” (with R.M.A. Silva, P.M. Pardalos, and J.L.D. Facó), Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 2201–2206, Cancun, June 20–23, 2013.
https://doi.org/10.1109/cec.2013.6557830
“Biased and unbiased random key genetic algorithms: An experimental analysis,” (with J.F. Gonçalves and R.F. Toso), Proceedings of the 10th Metaheuristics International Conference (MIC 2013), Singapore, 2013.
“Biased random-key genetic algorithm for bound-constrained global optimization,” (with R.M.A Silva P.M. Pardalos, and J.F. Gonçalves), in Proceedings of Global Optimization Workshop (GOW 2012), pp. 133–136, Natal, Brazil, 2012.
“Disjoint-path facility location: Theory and practice,” (with L. Breslau, I. Diakonikolas, N. Duffield, Yu Gu, M.T. Hajiaghayi, D.S. Johnson, H. Karloff, and S. Sen), Proceedings of the 13th Workshop of Algorithm Engineering and Experiments (ALENEX11), SIAM, San Francisco, pp. 60–74, January 22, 2011.
https://doi.org/10.1137/1.9781611972917.7
“A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering,” (with L.S. Pessôa and C.C. Ribeiro), in Proceedings of Matheuristics 2010, Vienna, June 2010.
“A hybrid genetic algorithm for road congestion minimization,” (with L.S. Buriol, M.J. Hirsch, P.M. Pardalos, T. Querido, and M. Ritt), in Proceedings of the XLI Symposium of the Brazilian Operational Research Society (XLI SBPO), Porto Seguro, Brazil, September 2009.
“GRASP with path-relinking for the generalized quadratic assignment problem,” (with G.R. Mateus and R.M.A. Silva), in Proceedings of the International Network Optimization Conference (INOC 2009), Pisa, Italy, April, 2009.
“A memetic algorithm for the weight setting problem in DEFT,” (with R. Reis, L.S. Buriol, and M. Ritt) in Proceedings of the XL Brazilian Symposium in Operational Research, João Pessoa, Brazil, 2008.
“A random-keys genetic algorithm for routing and wavelength assignment,” (with T.F. Noronha and C.C. Ribeiro) in Proceedings of VII Metaheuristics International Conference, Montréal, 2007.
“GRASP with evolutionary path-relinking,” (with D.V. Andrade) Proceedings of VII Metaheuristics International Conference, Montréal, 2007.
“GRASP with path-relinking for network migration scheduling,” (with D. V. Andrade), in in Proceedings of International Network Optimization Conference (INOC 2007), Spa, Belgium, 2007.
“Sensor registration in a sensor network by continuous GRASP,” (with M.J. Hirsch and P.M. Pardalos) in Proceedings of IEEE Military Communications Conference (MILCOM 2006), 2006.
https://doi.org/10.1109/milcom.2006.302435
“Survivable composite-link IP network design with OSPF routing,” (with D. V. Andrade, L.S. Buriol, and M. Thorup) in Proceedings of the 8th INFORMS Telecommunications Conference, Dallas, Texas, March 30~– April 1, 2006.
“A GRASP for PBX telephone migration scheduling,” (with D.V. Andrade), in Proceedings of the 8th INFORMS Telecommunications Conference, Dallas, Texas, March 30 – April 1, 2006.
“Modeling and solving string selection problems,” (with C.N. Meneses, P.M. Pardalos, and A. Vazacopoulos), in Proceedings of the 2005 International Symposium on Mathematical and Computational Biology – BIOMAT 2005, R. Mondaini and R. Dilão (eds.), E-papers Serviços Editoriais Ltda., Rio de Janeiro, pp. 54–64, 2006.
“TIE Breaking: Tunable Interdomain Egress Selection,” (with R. Teixeira, T.G. Griffin, and J. Rexford) in CoNEXT, ACM Conference on Emerging Network Experiment and Technology, Toulouse, France, pp. 93–104, ACM Press, 2005.
“A GRASP heuristic for the cooperative communication problem in ad hoc networks,” (with C. Commander, C.A.S. Oliveira, and P.M. Pardalos) Proceedings of VI Metaheuristics International Conference, pp. 225–230, Vienna, 2005.
“Network design for OSPF routing,” (with L.S. Buriol, P.M. França, and M. Thorup), in Proceedings of Mathematical Programming in Rio, L. Wolsey (Ed.), Búzios, Rio de Janeiro, Brazil, pp. 40-44, 2003.
“A relax and cut algorithm for the prize collecting Steiner problem in graphs,” (with A.S. da Cunha, A. Lucena, and N. Maculan), in Proceedings of Mathematical Programming in Rio, L. Wolsey (Ed.), Búzios, Rio de Janeiro, Brazil, pp. 72-78, 2003.
https://doi.org/10.1016/j.dam.2008.02.014
“Optimal Internet traffic routing,” Proceedings of the XXXV Brazilian Operations Research Symposium, Natal, Brazil, pp. 1722–1732, November 2003, in Portuguese.
“On the implementation of a swap-based local search procedure for the p-median problem,” (with R.F. Werneck), in Proceedings of the 5th Workshop on Algorithm Engineering and Experiments (ALENEX'03), Richard E. Ladner (Ed.), SIAM, Philadelphia, pp. 119-127, 2003.
“GRASP and path-relinking: Recent advances and applications,” (with C.C. Ribeiro), Proceedings of the 5th Metaheuristics International Conference (MIC2003), pages T6-1 – T6–6, 2003.
“CIRCUT+PR: A rank-2 heuristic with path-relinking,” (with P. Festa), Proceedings of the 5th Metaheuristics International Conference (MIC2003), pages 19-1 – 19–6, 2003.
“GRASP with path-relinking for the QAP,” (with C.A. Oliveira and P.M. Pardalos), Proceedings of the 5th Metaheuristics International Conference (MIC2003), pages 57-1 – 57–6, 2003.
https://doi.org/10.1007/978-0-387-71921-4_7
“GRASP with path-relinking for expansion planning of transmission networks,” (with H. de Faria Jr., S. Binato and D.J. Falcão), in Proceedings of the XIV Brazilian Automation Conference, Natal, Brazil, pp. 599–604, 2002.
“A memetic algorithm for OSPF routing,” (with L. Buriol, C.C. Ribeiro, and M. Thorup), in Proceedings of the 6th INFORMS Telecom, Boca Raton, Florida, pp. 187–188, 2002.
“Generating lower bounds for the prize collecting Steiner problem in graphs,” (with A. Lucena), in Electronic Notes in Discrete Mathematics: Proceedings of the Brazilian Symposium on Graphs, Algorithms and Combinatorics, Volume 7, pp. 1–4, April 2001.
https://doi.org/10.1016/s1571-0653(04)00227-6
“Reactive GRASP with path relinking for channel assignment in mobile phone networks,” (with F. C. Gomes, P. M. Pardalos, and C. S. Oliveira), in Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Rome, Italy, ACM Press, New York, pp. 60–67, 2001.
https://doi.org/10.1145/381448.381456
“GRASP and VNS for Max-Cut,” (with P. Festa and, P.M. Pardalos, and C.C. Ribeiro), in Proceedings of the IV Metaheuristics International Conference (MIC2001), J.P. Sousa (Ed.), Porto, Portugal, pp. 371–376, 2001.
“Greedy randomized adaptive path relinking,” (with S. Binato and H. Faria Jr.), in Proceedings of the IV Metaheuristics International Conference (MIC2001), J.P. Sousa (Ed.), Porto, Portugal, pp. 393–397, 2001.
“A GRASP for computing approximate solutions for the three-index assignment problem,” (with R.M. Aiex, P.M. Pardalos, and L.S. Pitsoulis), Proceedings of Parallel and Distributed Processing, Lecture Notes in Computer Science, vol. 1800, p. 504, 2000.
https://doi.org/10.1007/3-540-45591-4_67
“Local search with perturbations for the prize-collecting Steiner tree problem,” (with S.A. Canuto, and C.C. Ribeiro), in Proceedings of the III Metaheuristics International Conference (MIC99), P. Hansen and C.C. Ribeiro (Eds.), Angra dos Reis, Brazil, pp. 115–119, 1999.
https://doi.org/10.1002/net.1023
“A parallel GRASP for the Steiner problem in graphs using a hybrid local search,” (with S.L. Martins, and C.C. Ribeiro), in Proceedings of the III Metaheuristics International Conference (MIC99), P. Hansen and C.C. Ribeiro (Eds.), Angra dos Reis, Brazil, pp. 317–322, 1999.
https://doi.org/10.1023/a:1026546708757
“A GRASP for frame relay permanent virtual circuit routing,” (with L.I.P. Resende), in Proceedings of the III Metaheuristics International Conference (MIC99), P. Hansen and C.C. Ribeiro (Eds.), Angra dos Reis, Brazil, pp. 397–401, 1999.
“Piecewise linear time series estimation with GRASP,” (with M.C. Medeiros and A. Veiga), in Proceedings of the III Metaheuristics International Conference (MIC99), P. Hansen and C.C. Ribeiro (Eds.), Angra dos Reis, Brazil, pp. 329–333, 1999.
“A GRASP for job shop scheduling,” (with S. Binato, W.J. Hery, and D.M. Loewenstern), in Proceedings of the III Metaheuristics International Conference (MIC99), P. Hansen and C.C. Ribeiro (Eds.), Angra dos Reis, Brazil, pp. 57–61, 1999.
“GRASP: A bibliography, in Proceedings of the III Metaheuristics International Conference (MIC99), P. Hansen and C.C. Ribeiro (Eds.), Angra dos Reis, Brazil, pp. 403–410, 1999.
“On large maximum clique problems, (with J. Abello and P.M. Pardalos), in Proceedings of Algorithms and Experiments (ALEX98), R. Battiti and A. Bertossi (Eds.), Trento, Italy, pp. 175–183, February 9–11, 1998.
“A truncated interior point method for the solution of minimum cost flow problems on an undirected multicommodity network,” (with J. J. Júdice, L. F. Portugal, and G. Veiga), in Proceedings of the 1st National Telecommunications Conference, Aveiro, Portugal, April 10–11, 1997, in Portuguese.
“Identifying the optimal face of a network linear program with a globally convergent interior point method,” (with T. Tsuchiya and G. Veiga), in NETFLOW93, Technical Report TR-21/93, Dipartimento di Informatica, Università di Pisa, pp. 196–206, October 3–7, 1993.
“An interior point approach to Boolean vector function synthesis,” (with A.P. Kamath, N. Karmarkar, and K.G. Ramakrishnan), Proceedings of the 36th MSCAS, pp. 185–189, 1993.
https://doi.org/10.1109/mwscas.1993.343098
“Computational experience with an interior point algorithm on the Satisfiability problem,” (with A.P. Kamath, N. Karmarkar, and K.G. Ramakrishnan), Proceedings of the MPS Conference on Integer Programming and Combinatorial Optimization, Waterloo, pp. 333–349, May 1990.
https://doi.org/10.1007/bf02283686
“An interior point approach to the maximum independent set problem in dense random graphs,” (with N. Karmarkar, M.G.C. Resende, K.G. Ramakrishnan), Proceedings of the XIII Latin American Conference on Informatics, volume 1, pp. 241–260, Santiago, Chile, July 1989.
“Beyond the spreadsheet– Wafer production planning with start demand rate calculation through simulation models,” (with R.A. Zuanich and D.F. Ruffcorn), J. Electrochemical Society, vol. 135, pp. C371–C371, 1988.
“Seeking an optimally balanced dispatching rule for semiconductor wafer fabrication,” (with C.R. Glassey), J. Electrochemical Society, vol. 133, pp. C327–C327, 1986.
“Implementation and testing of a primal-dual algorithm for the assignment problem,” Proceedings of the XIII Brazilian Operations Research Symposium, pp. 284–299, October 1980, in Portuguese.
https://doi.org/10.1287/opre.31.2.277
8 entries
Handbook of Heuristics, Second Edition, Co-edited with R. Mart\'i and P.M. Pardalos, SpringerNature, New York, 2025.
https://doi.org/10.1007/978-3-032-00385-0
Handbook of Heuristics, First Edition, Co-edited with R. Mart\'i and P.M. Pardalos, SpringerNature, New York, 2018.
https://doi.org/10.1007/978-3-319-07153-4
Optimization by GRASP – Greedy Randomized Adaptive Search Procedures, with C.C. Ribeiro, Springer, New York, November 2016.
Handbook of Optimization in Telecommunications, Co-edited with P.M. Pardalos, Springer, New York, April 2006.
https://doi.org/10.1007/978-0-387-30165-5
Metaheuristics: Computer Decision-Making, Co-edited with J.P. de Sousa, Kluwer Academic Publishers, Boston, December 2003.
https://doi.org/10.1007/978-1-4757-4137-7
Handbook of Massive Data Sets, Co-edited with J. Abello and P.M. Pardalos, Kluwer Academic Publishers, Boston, May 2002.
https://doi.org/10.1007/978-1-4615-0005-6
Handbook of Applied Optimization, Co-edited with P.M. Pardalos, Oxford University Press, New York, March 2002. Outstanding Professional and Scholarly Titles of 2002, Honorable Mention, Association of American Publishers.
Parallel Processing of Discrete Optimization Problems, Co-edited with P.M. Pardalos and K.G. Ramakrishnan, volume 22 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, New Providence, 1995.
https://doi.org/10.1090/dimacs/022