Conference and university talks
380 invited, plenary, tutorial, contributed, conference, and university presentations from 1980 through 2026.
380 entries
“Random-Key Optimizers: Problem Independent Combinatorial Optimization,” Invited plenary tutorial, 16th Metaheuristics International Conference (MIC 2026), Ischia, Italy, June 8–11, 2026.
“Random-Key Optimizers: Problem Independent Combinatorial Optimization,” Invited plenary talk given at the 2026 Regional Conference on Applied and Computational Mathematics (ERMAC 2026), Florianópolis, SC, Brazil, March 2, 2026.
“Presenting the Handbook of Heuristics, 2nd edition,” Invited plenary talk (with Rafael Martí), V Congreso Grupo CÁTEDRA, OGA, Seville, Spain, January 21–23, 2026.
“Random-Key Optimizers – Problem Independent Combinatorial Optimization,” Invited plenary lecture, 5th Winter School on Heuristic Optimization, La Laguna, Islas Canarias, Spain, January 13–14, 2026.
“Four decades of industry-university collaboration,” Invited remote talk, Grupo CÁTEDRA, OGA, Seville, Spain, December 18, 2025.
“An introduction to the metaheuristic GRASP,” Invited talk, Department of Industrial Engineering, PUC-Rio, Rio de Janeiro, Brazil, November 6, 2025.
“Quarenta anos de colaboração entre indústria e universidade,” Invited talk, Computing Institute, Federal U. of Bahia, Salvador, Brazil, July 17, 2025.
“Random-Key Optimizers – RKO Solver,” Invited remote plenary talk, XV International Conference on Network Analysis (NET 2025), Nizhny Novgorod, Russia & Zoom, May 19–20, 2025.
“Random-Key Optimizers: RKO Solver,” Invited talk, 18th INFORMS Computing Society (ICS) Conference, Toronto, Canada, 14–16 March 2025
“Logistics Optimization at Amazon: Big Data & Operations Research in Action,” Invited plenary talk, IV Congreso Grupo CÁTEDRA, OGA, Seville, Spain, January 22–24, 2025
“Random-Key Optimizers – Problem Independent Combinatorial Optimization,” Invited plenary talk, 34th Brazilian Conference on Intelligent Systems (BRACIS 2024), Belém, PA, Brazil, November 17–21, 2024.
“Random-Key Optimizers – A tutorial,” Invited short course, LVI Symposium of the Brazilian Operational Research Society (SBPO 2024), Fortaleza, CE, Brazil, November 4–7, 2024.
“Experience with Applied Mathematics in the Telecommunications and E-Commerce Industries,” Invited plenary talk, XLIII Brazilian Conference on Applied and Computational Mathematics (CNMAC 2024), Porto de Galinhas, PE, Brazil, September 16–20, 2024.
“Operations Research Challenges at Amazon,” Invited talk, ITA-UNIFESP Joint Post-Graduate Program in Operations Research, São José dos Campos, SP, Brazil, August 26, 2024.
“My 30+ years of research collaboration with Panos Pardalos,”Optimization, Analytics, and Decisions in the Big Data Era – In Honor of the 70th Birthday of Panos Pardalos, Halkidiki, Greece, June 17, 2024.
“Random-Key Optimizers – A tutorial,”LION 18, The 18th Learning and Intelligent Optimization Conference, Ischia Island, Italy, June 9, 2024.
“A Continuous GRASP Random-Key Optimizer,”MIC 2024 – 15th Metaheuristics International Conference, Lorient, France, June 4, 2024.
“Quarenta anos de colaboração entre indústria e universidade,” Invited inaugural lecture period 2024.1, Center for Technology and Science, Pontifical Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil, March 20, 2024.
“Forty years of industry-university collaboration,” Invited talk, Optimization Lab, U. Degli Studi di Udine, Udine, Italy, March 7, 2024.
“Quarenta anos de colaboração entre indústria e universidade,” Invited plenary talk, XXI SEPROSUL, Santa Maria, RS, Brazil, November 16, 2023.
“Quarenta anos de colaboração entre indústria e universidade,” Invited plenary talk, LV Brazilian Symposium of Operational Research (SBPO 2023), São José dos Campos, SP, Brazil, November 7, 2023.
“Forty years of industry-university collaboration,” Invited plenary talk, 65th Annual Conference of the Operational Research Society (OR65), Bath, England, September 13, 2023.
“BRKGA for the Home Health Care Problem,” invited talk, Triannual conference of the International Federation of Operational Research Societies – IFORS 2023, Santiago, Chile July 10, 2023.
“Operations Research at Amazon,” invited virtual talk, McDonough School of Business, Georgetown U., Washington, DC, USA, June 21, 2023.
“Forty years of industry-university collaboration,” invited talk, U. Rey Juan Carlos, Department of Computer Science, Madrid, Spain, April 26, 2023.
“Operations Research at Amazon,” joint invited plenary talk with José F. Gonçalves, 2023 Brazilian Workshop on Packing and Cutting, U. of São Paulo, São Carlos, SP, Brazil, March 3, 2023.
“The importance of routing at Amazon,” invited talk, Universidade Federal de São Paulo – UNIFESP, São José dos Campos, SP, Brazil, February 15, 2023.
“Short course – Data Science in Metaheuristics,”Instituto Tecnológico de Aeronáutica – ITA, São José dos Campos, SP, Brazil, February 1–28, 2023.
“Random-Key Optimization – Problem independent solvers for combinatorial optimization,” contributed talk, INFORMS Annual Meeting, Indianapolis, Indiana, October 16, 2022.
“Random-Key Optimization – Problem independent solvers for combinatorial optimization,,” contributed talk, INFORMS Annual Meeting, Indianapolis, Indiana, October 16, 2022.
“ATS Transportation Hub Network Design,” invited virtual talk, 2022 Amazon Sustainability Science and Innovation Conference, Bellevue, Washington, September 9, 2022.
“A metaheuristic algorithm for large maximum weight independent set problems,” invited talk, Amazon Transportation Services Labs, LUX20, Luxembourg, September 1, 2022.
“Logistics Optimization at Amazon: Operations Research in Action,” virtual talk given at Department of Logistics, Molde University College, Molde, Norway, August 22, 2022.
“Optimization by BRKGA,” invited virtual talk, 2022 IACT Global Summit, Amazon, Austin, Texas, April 7, 2022.
“Tribute to David S. Johnson,” invited virtual plenary talk, 12th DIMACS Implementation Challenge: VRP, Piscataway, New Jersey, April 5, 2022.
“Logistics Optimization at Amazon: Big Data & Operations Research in Action,” invited virtual plenary talk, XIV Chilean Conference on Operations Research (OPTIMA 2021), Talca, Chile, March 8, 2022.
“2021 INFORMS Prize – Amazon,,” invited talk (with T.L. Jacobs and N. Noyan-Bulbul), INFORMS Annual Meeting, Anaheim, California, October 25, 2021.
“The multi-parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications,” invited virtual talk, 11th Conference on Network Analysis (NET2021), Nizhny Novgorod, Russian Federation, October 18, 2021.
“Logistics Optimization at Amazon: Operations Research in Action,” virtual talk given at Department of Logistics, Molde University College, Molde, Norway, September 13, 2021.
“The multi-parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications,” contributed talk, IFORS 2021, Virtual, Seoul, Korea, August 26, 2021.
“Logistics Optimization at Amazon: Operations Research in Action,” virtual inaugural lecture (Aula Magna), Aeronautics Institute of Technology (ITA) / Federal U. of São Paulo (UNIFESP), São José dos Campos, SP, Brazil, August 9, 2021.
“Logistics Optimization at Amazon: Operations Research in Action,,” invited talk, SGLog, Federal University of Pernambuco, Virtual, Caruaru, PE, Brazil, August 6, 2021.
“Path-relinking intensification in local search,” invited talk, Amazon Transportation Services Labs, Luxembourg, Virtual, July 20, 2021.
“Biased random-key genetic algorithms: Global optimization solutions from random building blocks,,” invited talk, Metaheuristics Summer School (MESS 2021), U. of Catania, Virtual, Catania, June 17, 2021.
“GRASP: Greedy Randomized Adaptive Search Procedures – Some recent advances,,” invited talk, Metaheuristics Summer School (MESS 2021), U. of Catania, Virtual, Catania, June 16, 2021.
“Logistics Optimization at Amazon: Operations Research in Action,,” invited talk, Department of Industrial Engineering, Pontifical Catholic University of Rio de Janeiro, Virtual, Rio de Janeiro, May 21, 2021.
“Operations Research at Amazon,,” invited plenary talk, 2021 INFORMS Pacific Northwest Regional Analytics Conference, Virtual, Seattle, May 13–14, 2021.
“Biased random-key genetic algorithms: Global optimization solutions from random building blocks,,” invited talk, Amazon Transportation Services Labs, Luxembourg, Virtual, April 27, 2021.
“GRASP: Some recent developments,,” invited talk, Amazon Transportation Services Labs, Luxembourg, Virtual, April 15, 2021.
“2021 INFORMS Prize – Amazon,,” INFORMS Prize Ceremony talk (with T.L. Jacobs and N. Noyan-Bulbul), INFORMS Business Analytics Conference, Virtual, April 13, 2021.
“Logistics Optimization at Amazon: Big Data & Operations Research in Action,” invited talk, University of Massachusetts - Isenberg School of Management, Virtual, March 5, 2021.
“Amazon Middle-Mile Routing – Part II: Local search algorithm,”INFORMS Annual Meeting, Virtual, November 13, 2020.
“Biased random-key genetic algorithms: Global optimization solutions from random building blocks,” invited talk, Industrial and Systems Engineering Department, University of Washington, Seattle, WA, USA, April 29, 2020.
“Routing at Amazon,” invited plenary talk, 106th Transportation and Highway Engineering Conference, University of Illinois at Urbana-Champaign (UIUC), Illinois, February 25, 2020.
“Biased random-key genetic algorithms: Learning intelligent solutions from random building blocks,” invited online talk, Computational Optimization and Innovation (COIN) Laboratory, Electrical and Computer Engineering Department, Michigan State University, East Lansing, Michigan, November 20, 2019.
“Thirty-five years of industry-university collaboration,” invited talk, Computing Institute, Fed. U. of Rio Grande do Sul (UFRGS), Porto Alegre, RS, Brazil, November 6, 2019.
“Logistics optimization at Amazon: Operations research in action,” invited talk, Computing Institute, Fed. U. of Rio Grande do Sul (UFRGS), Porto Alegre, RS, Brazil, November 5, 2019.
“Biased random-key genetic algorithms,” invited online talk, Industrial Engineering Department, Pontifical Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil, October 10, 2019.
“Biased random-key genetic algorithms: Learning intelligent solutions from random building blocks,” invited plenary talk, 5th International Conference on Machine Learning, Optimization, and Data Science – LOD 2019, Siena, Italy, September 13, 2019.
“GRASP with solution blending for maximum weight independent set problem,” invited talk, EURO 2019, Dublin, Ireland, June 24, 2019.
“Routing problems at Amazon,” invited plenary talk, VeRoLog 2019, Seville, Spain, June 5, 2019.
“Biased random-key genetic algorithms: A tutorial,” invited talk, Industrial and Systems Engineering Department, U. of Washington, Seattle, WA, USA, May 6, 2019.
“Biased random-key genetic algorithms: Algorithms and Applications,” invited talk, Institute of Advanced Studies of the Alma Mater Studiorum, U. of Bologna, Bologna, Italy, March 13, 2019.
“Logistics optimization at Amazon: Operations Research in Action,” invited plenary talk, 2nd Conference of the EURO Working Group on Practice of Operations Research, Bologna, Italy, March 11, 2019.
“Logistics optimization at Amazon: Big Data & Operations Research in Action,” invited talk, U. of Colorado Denver Business School, Denver, Colorado, USA, February 1, 2019.
“Logistics optimization at Amazon: Big Data & Operations Research in Action,” invited talk, 2018 INFORMS Regional Analytics Conference, U. of Washington, Seattle, USA, September 14, 2018.
“Biased random-key genetic algorithms: A tutorial,” invited talk, 2018 Metaheuristics Summer School, Acireale, Catania, Sicily, Italy, July 23-24, 2018.
“Logistics optimization at Amazon: Big Data & Operations Research in Action,” invited talk, Department of Industrial Engineering, U. of Pittsburgh, Pittsburgh, USA, April 12, 2018.
“Path-relinking intensification in local search,” invited talk, Department of Industrial and Systems Engineering, U. of Washington, Seattle, WA, USA, February 27, 2018.
“GRASP – Greedy randomized adaptive search procedures: Some recent advances,” Invited Keynote Talk, 2017 Symposium of the Mexican Operations Research Society (SMIO 2017), Guadalajara, Mexico, October 5, 2017.
“GRASP – Greedy randomized adaptive search procedures: Some recent advances,” Constantine Carathedory Prize Plenary Talk, 2017 World Congress on Global Optimization (GOC 2017), College Station, Texas, U.S.A., March 31, 2017.
“An improved genetic algorithm for job shop scheduling,”INFORMS Annual Meeting, Nashville, TN, USA, November 13, 2016.
“Biased random-key genetic algorithms: An advanced tutorial,” Tutorial Talk, with C.C. Ribeiro, Genetic and Evolutionary Computation Conference (GECCO 2016), Denver, CO, U.S.A., July 20–24, 2016.
“Logistics optimization at Amazon: Big data & operational research in action,” Invited Keynote Talk, 28th European Conference on Operational Research, Pozna\'n, Poland, July 4, 2016.
“Interior-point methods – The early days: 1984 to 2001,”2nd Brazilian Workshop on Interior Point Methods, Invited Plenary Talk, Campinas, SP, Brazil, May 17–18, 2016.
“Metaheuristic approaches to continuous global optimization,”2nd Brazilian Workshop on Interior Point Methods, Invited Plenary Talk, Campinas, SP, Brazil, May 17–18, 2016.
“A biased random-key genetic algorithm for the capacitated minimum spanning tree problem,”13th INFORMS Telecommunications Conference, Boca Raton, FL, U.S.A., March 20, 2016.
“Biased random-key genetic algorithms,” Invited Talk, Institute of Computing, Federal U. of Rio Grande do Sul (UFRGS), Porto Alegre, RS, Brazil, December 9, 2015.
“A biased random-key genetic algorithm for the capacitated minimum spanning tree problem,” Invited Talk, 2015 INFORMS Annual Meeting, Philadelphia, PA, USA, November 1, 2015.
“Biased random-key genetic algorithms,” Invited Plenary Talk, 2nd Brazilian Conference on Industrial Applications of Mathematics (CNMAI 2015), Fortaleza, CE, Brazil, October 5, 2015.
“Logistics optimization at Amazon: Big data & operations research in action,” Invited Plenary Talk, XLVII Symposium of the Brazilian Operations Research Society (XLVII SBPO), Porto de Galinhas, PE, Brazil, August 26, 2015.
“Biased random-key genetic algorithms,” Invited Talk, Department of Industrial Engineering, Pontifical Catholic U. of Rio de Janeiro, Rio de Janeiro, Brazil, August 24, 2015.
“Biased random-key genetic algorithm for wireless backhaul network design,” Contributed Talk, 11th Metaheuristics International Conference (MIC 2015), Agadir, Morocco, June 8, 2015.
“Biased random-key genetic algorithms,” Invited Plenary Talk, 11th Metaheuristics International Conference (MIC 2015), Agadir, Morocco, June 8, 2015.
“Packing with biased random-key genetic algorithms,” Invited Talk, Computing Institute, State U. of Campinas (UNICAMP), Campinas, SP, Brazil, March 3, 2015.
“Packing with biased random-key genetic algorithms,” Invited Talk, Mathematical Optimization Group, Amazon.com, Seattle, WA, USA, February 10, 2015.
“Packing with biased random-key genetic algorithms,” Invited Talk, Department of Industrial and Systems Engineering, U. of Washington, Seattle, WA, USA, January 20, 2015.
“A biased random-key genetic algorithm for the unequal area facility layout problem,” Contributed Talk, 2014 INFORMS Annual Meeting, San Francisco, CA, USA, November 10, 2014.
“Packing with biased random-key genetic algorithms,” Invited Talk, Department of Information Sciences and Technology, Penn State U. – Berks, Reading, PA, USA, October 1, 2014.
“Packing with biased random-key genetic algorithms,” Invited Talk, Summer School on Operational Research & Applications, Kstovsky District, Russia, May 15, 2014.
“Some applications of biased random-key genetic algorithms in telecommunications,” Invited Talk, Summer School on Operational Research & Applications, Kstovsky District, Russia, May 15, 2014.
“GRASP: Advances and applications,” Invited Talk, Summer School on Operational Research & Applications, Kstovsky District, Russia, May 14, 2014.
“A biased random-key genetic algorithm for a prize-collecting directed Steiner forest network design problem,”Fourth International Conference on Network Analysis (NET 2014), Nizhny Novgorod, Russia, May 13, 2014.
“Biased random-key genetic algorithms,” Two-day short course, Universidade Federal Fluminense (UFF), Niterói, RJ, Brazil, April 23 and 30, 2014.
“GRASP heuristics for discrete and continuous global optimization,” Invited Talk, Amazon.com, Seattle, WA, USA, April 11, 2014.
“Packing with biased random-key genetic algorithms,” INFORMS Student Chapter Invited Lecture, Department of Industrial and Systems Engineering, Texas A&M University, College Station, TX, USA, March 28, 2014.
“Packing with biased random-key genetic algorithms,” Invited Talk, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA, March 19, 2014.
“A biased random-key genetic algorithm for a prize-collecting directed Steiner forest network design problem,”2014 INFORMS Telecommunications Conference, Lisbon, Portugal, March 3, 2014.
“Packing with biased random-key genetic algorithms,” Invited Talk, Department of Production and Systems Engineering, University of Minho, Braga, Portugal, February 28, 2014.
“GRASP heuristics for discrete and continuous global optimization,” Invited Tutorial, Learning and Intelligent Optimization Conference (LION 8), Gainesville, FL, USA, February 19, 2014.
“Randomized heuristics for handover minimization,” Invited Talk, 2013 INFORMS Annual Meeting, Minneapolis, MN, USA, October 6, 2013.
“Packing with biased random-key genetic algorithms,” Invited Talk, GE Global Research, Rio de Janeiro, Brazil, September 26, 2013.
“Introduction to biased random-key genetic algorithms,” Invited Talk, XVL Symposium of the Brazilian Operations Research Society, Natal, Brazil, September 18, 2013.
“Hybridization of heuristics with biased random-key genetic algorithms: Application to 2-dim orthogonal packing and 3-dim bin packing,” Invited Plenary Talk, 8th International Workshop on Hybrid Metaheuristics (HM 2013), Ischia Island, Italy, May 23, 2013.
“Packing with biased random-key genetic algorithms,” Invited Talk, Monterrey Institute of Technology, Monterrey, Mexico, May 7, 2013.
“Biased random-key genetic algorithms with applications to optimization problems in telecommunications,” Invited Talk, Institute of Science and Technology, Federal U. of São Paulo (UNIFESP), São José dos Campos (SP), Brazil, March 27, 2013.
“GRASP heuristics for discrete and continuous global optimization,” Invited Talk, Department of Production Engineering, Federal U. of São Carlos, São Carlos (SP), Brazil, March 26, 2013.
“Biased random-key genetic algorithms with applications to optimization problems in telecommunications,” Invited Talk, Institute of Mathematical Sciences and Computing, State U. of São Paulo, São Carlos (SP), Brazil, March 25, 2013.
“Packing with biased random-key genetic algorithms,” Invited Plenary Talk, XV Brazilian Workshop on Packing, Cutting, Lot Sizing, and Production Planning (XV ONPCE), São José do Rio Preto (SP), Brazil, March 22, 2013.
“Biased random-key genetic algorithms,” Invited Plenary Talk, Learning and Intelligent Optimization Conference (LION 7), Catania, Sicily, Italy, January 8, 2013.
“Randomized heuristics for handover minimization,”Annual Meeting of the Institute for Operations Research and the Management Sciences (INFORMS), Phoenix, Arizona, October 15, 2012.
“Randomized heuristics for handover minimization,” Invited Talk, Joint Conference of the Brazilian Operational Research Society (SBPO 2012) and Latin-Iberian-American Conference on Operations Research (CLAIO 2012), Rio de Janeiro, Brazil, September 26, 2012.
“Biased random-key genetic algorithms: A tutorial,” IFORS Invited Tutorial Lecture, Joint Conference of the Brazilian Operational Research Society (SBPO 2012) and Latin-Iberian-American Conference on Operations Research (CLAIO 2012), Rio de Janeiro, Brazil, September 25-26, 2012.
“Packing rectangles with a biased random-key genetic algorithm,” Invited Talk, IBM Research - Brazil, Rio de Janeiro, Brazil, September 17, 2012.
“Randomized heuristics for handover minimization,” Invited seminar, Computer Science Institute, Federal U. of Rio Grande do Sul, Porto Alegre, RS, Brazil July 6, 2012.
“Randomized heuristics for handover minimization,” Invited plenary talk, 2nd International Conference on Network Analysis (NET 2012), Nizhny Novgorod, Russia, May 9, 2012.
“Solving handover minimization as a generalized quadratic assignment problem,”2012 INFORMS Telecommunications Conference, Boca Raton, Florida, USA, March 16, 2012.
“GRASP heuristics for discrete and continuous global optimization,” Invited tutorial, Latin American Summer School in Operations Research (ELAVIO 2012), Bento Gonçalves, RS, Brazil, February 6, 2012.
“Biased random-key genetic algorithms with applications to optimization problems in telecommunications,” Invited tutorial, Latin American Summer School in Operations Research (ELAVIO 2012), Bento Gonçalves, RS, Brazil, February 6, 2012.
“A Python/C library for bound-constrained global optimization with Continuous GRASP,” Invited Talk, INFORMS Annual Meeting, Charlotte, N.C., USA, November 14, 2011.
“Biased random-key genetic algorithms with applications to optimization problems in telecommunications,” Invited Talk, Computer Science Institute, U. Federal Fluminense, Niterói, RJ, Brazil, September 21, 2011.
“Analysis of social networks,” Four-day short course, Computer Science Institute, U. Federal Fluminense, Niterói, RJ, Brazil, September 13-21, 2011.
“A biased random-key genetic algorithm for the Steiner triple covering problem,”9th Metaheuristics International Conference (MIC 2011), Udine, Italy, July 28, 2011.
“Biased random-key genetic algorithms with applications in telecommunications,” Invited plenary talk, Optimization 2011, Lisbon, Portugal, July 25, 2011.
“Restart strategies for GRASP with path-relinking heuristics,”10th International Symposium on Experimental Algorithms (SEA 2011), Chania, Crete, Greece, May 5, 2011.
“GRASP heuristics for discrete and continuous global optimization,” Invited lecture, Spring School on Advances in Operations Research, Higher School of Economics, Nizhny Novgorod, Russia, May 3, 2011.
“Biased random-key genetic algorithms with applications to optimization problems in telecommunications,” Invited lecture, Spring School on Advances in Operations Research, Higher School of Economics, Nizhny Novgorod, Russia, May 3, 2011.
“GRASP heuristics for discrete & continuous global optimization,” Invited lecture, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, January 27, 2011.
“Design of metro Ethernet networks,” Invited Talk, INFORMS Annual Meeting, Austin, Texas, November 8, 2010.
“Heuristics for the regenerator location problem,” Invited Talk, INFORMS Annual Meeting, Austin, Texas, November 8, 2010.
“GRASP with path-relinking,” Invited short course, II Peruvian Conference on Operations Research and Systems (COPIOS 2010), Arequipa, Peru, November 4-5, 2010.
“Packing rectangles with a biased random-key genetic algorithm,” Invited opening plenary talk, II Peruvian Conference on Operations Research and Systems (COPIOS 2010), Arequipa, Peru, November 4, 2010.
“Biased random-key genetic algorithms with applications to optimization problems in telecommunications,” Invited Talk, Industrial Engineering Department, U. Nacional San Agustín, Arequipa, Peru, November 2, 2010.
“Biased random-key genetic algorithms with applications to optimization problems in telecommunications,” Invited plenary talk, XXXII National Conference of Statistics and Operations Research (SEIO 2010), A Coruña, Spain, September 16, 2010.
“Packing rectangles with a biased random-key genetic algorithm,” Invited Talk, Universitat Politècnica de Catalunya, Barcelona, Spain, September 10, 2010.
“Hybridizations of GRASP with path-relinking,” Invited plenary talk, VII Spanish Conference on Metaheuristics and Evolutionary & Bioinspired Algorithms (MAEB 2010), Valencia, Spain, September 8, 2010.
“Packing rectangles with a genetic algorithm,” Invited Talk, Florham Park Mathematics Research Colloquium and Informal Seminar, AT&T Labs Research, Florham Park, New Jersey, August 6, 2010.
“Automatic tuning of GRASP with path-relinking heuristics with a biased random-key genetic algorithm,” Invited Talk, ALIO-INFORMS Joint International Meeting, Buenos Aires, Argentina, June 6–9, 2010.
“A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem,” Invited Talk, ALIO-INFORMS Joint International Meeting, Buenos Aires, Argentina, June 6–9, 2010.
“Biased random-key genetic algorithms with applications in telecommunications,” Plenary speaker, 10th INFORMS Telecommunications Conference, Montréal, Canada, May 6,2010.
“Biased random-key genetic algorithms with applications in telecommunications,” Invited Talk, INESC – Instituto de Engenharia de Sistemas e Computadores do Porto, Porto, Portugal, April 13, 2010.
“Hospital layout optimization using GRASP with path-relinking,” Invited plenary talk, International Conference on System Analysis Tools for Better Health Care Delivery: A New Engineering / Health Care Partnership, Gainesville, Florida, March 24–26, 2010.
“Algorithms for node placement in path-disjoint network monitoring,” Invited Talk, Industrial Engineering Department, University of Pittsburgh, Pittsburgh, PA, March 4, 2010.
“GRASP with evolutionary path-relinking for the antibandwidth problem,” Invited Talk, 2nd International Conference on the Dynamics of Information Systems, Destin, Florida, February 3–5, 2010.
“GRASP with path-relinking,” Invited short course, 1st Brazil-Portugal School on Evolutionary Computing, Belo Horizonte, Brazil, October 20–23, 2009.
“A hybrid genetic algorithm for road congestion minimization,” Contributed talk, 2009 INFORMS Annual Meeting, San Diego, California, October 11–14, 2009.
“A biased random-keys genetic algorithm for monitor placement in telecommunication networks,” Invited Talk, 2009 INFORMS Annual Meeting, San Diego, California, October 11–14, 2009.
“GRASP with evolutionary path-relinking for the antibandwidth problem,” Invited Talk, 2009 INFORMS Annual Meeting, San Diego, California, October 11–14, 2009.
“Optimization in the design and operations of telecommunication systems,” Invited three-day short course, Academic and Professional Operations Research School, Department of Mathematics, U. Nacional Mayor de San Marcos, Lima, Peru, September 14–16, 2009.
“GRASP with path-relinking for the generalized quadratic assignment problem,”VIII Metaheuristics International Conference (MIC 2009), Hamburg, Germany, July 16, 2009.
“GRASP with evolutionary path-relinking for the antibandwidth problem,”VIII Metaheuristics International Conference (MIC 2009), Hamburg, Germany, July 14, 2009.
“Algorithms for node placement in path-disjoint network monitoring,” Invited lecture, Computer Science Institute, U. Fed. Fluminense (UFF), Niterói, RJ, Brazil, May 14, 2009.
“Metaheuristic hybridization with GRASP,” Invited lecture, Department of Applied Computer Science, Federal University of the State of Rio de Janeiro (UNIRIO), Rio de Janeiro, Brazil, May 11 & 13, 2009.
“Algorithms for node placement in path-disjoint network monitoring,” Invited lecture, Artificial Intelligence and Data Analysis Lab, U. of Porto, Porto, Portugal, March 16, 2009.
“Algorithms for node placement in path-disjoint network monitoring,” Invited lecture, Industrial and Systems Engineering Department, University of Florida, Gainesville, FL, November 13, 2008.
“Algorithms for node placement in path-disjoint network monitoring,” Invited lecture, Industrial and Systems Engineering Department, University of Florida, Gainesville, FL, November 13, 2008.
“Metaheuristic hybridization with GRASP,” Invited lecture, Industrial and Systems Engineering Department, University of Florida, Gainesville, FL, November 11, 2008.
“Metaheuristic hybridization with GRASP,” Invited tutorial talk, INFORMS Annual Meeting, Washington, D.C., USA, October 12-15, 2008.
“Algorithms for node placement in path-disjoint network monitoring,” Invited plenary talk, XXXIX Annual Conference of the Italian Operational Research Society (AIRO 2009), Ischia, Italy, September 8-11, 2008.
“A memetic algorithm for optimizing routing using exponential flow splitting,”18th Triennial Conference of the International Federation of Operational Research Societies (IFORS 2009), Standton, Johannesburg, South Africa, July 13-18, 2008.
“Metaheuristics in network design,” Invited plenary lecture, 7th International Workshop on Experimental Algorithms (WEA2008), Provincetown, Cape Cod, MA, May 31, 2008.
“Efficient implementations of heuristics for routing and wavelength assignment,”7th International Workshop on Experimental Algorithms (WEA2008), Provincetown, Cape Cod, MA, June 1, 2008.
“A genetic algorithm with random keys for node placement in path-disjoint network monitoring,” Invited lecture, DIMACS/DyDAn Workshop on Internet Tomography, DIMACS, Rutgers University, Piscataway, NJ, May 15, 2008.
“Metaheuristics in network design,” Invited lecture, Management Sciences Seminar, Management Science Department, University of Iowa, Iowa City, Iowa, May 9, 2008.
“Metaheuristics and network design,” Invited tutorial lecture, Network design workshop, Ninth INFORMS Telecommunications Conference, University of Maryland, College Park, Maryland, March 29, 2008.
“A memetic algorithm for routing optimization using exponential flow splitting,”Ninth INFORMS Telecommunications Conference, University of Maryland, College Park, Maryland, March 27-29, 2008.
“Some combinatorial optimization problems arising in telecommunications,” Invited lecture, Seminar in Industrial and Systems Engineering, Department of Industrial and Systems Engineering, Rutgers University, Piscataway, New Jersey, March 4, 2008.
“Some combinatorial optimization problems arising in telecommunications,” Invited lecture, Fields Industrial Optimization Seminar, Fields Institute for Research in Mathematical Sciences, Toronto, Canada, February 5, 2008.
“Optimization with random-key genetic algorithms,”Florham Park Mathematics Research Colloquium and Informal Seminar, AT&T Labs Research, Florham Park, NJ, December 14, 2007.
“GRASP with path-relinking for network migration scheduling,”INFORMS Annual Meeting (INFORMS 2007), Seattle, WA, November 4–7, 2007.
“A hybrid heuristic for the p-median problem,”INFORMS Annual Meeting (INFORMS 2007), Seattle, WA, November 4–7, 2007.
“A short course on greedy randomized adaptive search procedures,”XXXIX Symposium of the Brazilian Operational Research Society (XXXIX SBPO), Fortaleza, Brazil, August 28–31, 2007.
“GRASP with evolutionary path-relinking,”7th Metaheuristics International Conference (MIC 2007), Montréal, Canada, June 25–29, 2007.
“Network migration scheduling,” Cookie talk, Internet and Network Systems Research Center, AT&T Labs Research, Florham Park, NJ, June 2007.
“GRASP with path-relinking for network migration scheduling,”International Network Optimization Conference (INOC 2007), Spa, Belgium, April 2007.
“Some issues in the optimization of Internet traffic,” Invited lecture, Informatics Institute, Federal University of Rio Grande do Sul, Porto Alegre, Brazil, March 2007.
“Metaheuristics for combinatorial optimization problems arising in telecommunications,”12-hour course, CIMPA-UNESCO-URUGUAY School on “Mathematics for the Internet and New-Generation Networks,” La Pedrera, Uruguay, March 2007.
“GRASP for continuous global optimization,” in 2nd International Conference on Complementarity, Duality, and Global Optimization in Science and Engineering (CDGO 2007), U. of Florida, Gainesville, FL March 2007.
“Some issues in the optimization of Internet traffic,” Invited lecture, Department of Production Engineering, University of São Paulo, São Paulo, Brazil, August 2006.
“Some new optimization problems in telecommunications,” Invited lecture, Computer Science Department, Federal Fluminense University, Niterói, Brazil, August 2006.
“Global optimization by continuous GRASP,” in 19th International Symposium on Mathematical Programming (ISMP 2006), Rio de Janeiro, Brazil, July 31 – August 4, 2006.
“Global optimization by continuous GRASP,” in 21st European Conference on Operational Research (EURO 2006), Reykjavik, Iceland, July 2 – 5, 2006.
“Some issues in the optimization of Internet traffic,” Plenary lecture in DIMACS Workshop on Computational Optimization and Logistics Challenges in the Enterprise (COLCE), ExxonMobil Research & Engineering (EMRE) Annandale, New Jersey, April 19 – 20, 2006.
“Survivable composite-link IP network design with OSPF routing,” in 8th INFORMS Telecommunications Conference, Dallas, Texas, March 30 – April 1, 2006.
“A GRASP for PBX telephone migration scheduling,” in 8th INFORMS Telecommunications Conference, Dallas, Texas, March 30 – April 1, 2006.
“Combinatorial optimization for design and operations of telecommunication systems,” Invited lecture, Computer Science Department, Federal University of Minas Gerais, Belo Horizonte, MG, Brazil, December 2005.
“Combinatorial optimization for design and operations of telecommunication systems,” Invited lecture, Industrial and Systems Engineering Department, University of Florida, Gainesville, FL, October 2005.
“Solving covering problems with a heuristic for the p-median problem,” Invited Talk, XXXVI Conference of the Italian Operational Research Society, Camerino, Italy, September 2005.
“Combinatorial optimization for design and operations of telecommunication systems,” Opening plenary talk, XXXVI Conference of the Italian Operational Research Society, Camerino, Italy, September 2005.
“A GRASP heuristic for the cooperative communication problem in ad hoc networks,”VI Metaheuristics International Conference (MIC2005), Vienna, Austria, August 2005.
“Computational mathematics and operations research in telecommunication,”1st North/Northeast Meeting on Operations Research and Computational Mathematics, invited plenary talk, Maceió, Brazil, July 2005.
“Optimal design and operations of telecommunication systems,”International Conference on Industrial Logistics (ICIL'05), invited plenary talk, Montevideo, Uruguay, February 2005.
“A hybrid multistart heuristic for the uncapacitated facility location problem,”9th INFORMS Computing Society Conference, Annapolis, Maryland, January 2005.
“Combinatorial Optimization in Telecommunications,”XXXVI Symposium of the Brazilian Operational Research Society (SBPO XXXVI), invited plenary talk, São João del Rei, Brazil, November 2004.
“GRASP with path-relinking for the quadratic assignment problem,”III International Workshop on Efficient and Experimental Algorithms (WEA2004), Angra dos Reis, Brazil, May 2004.
“A hybrid multistart heuristic for the uncapacitated facility location problem,” invited talk, Multiscale Optimization: Methods and Applications, University of Florida, Gainesville, Florida, February 2004.
“A hybrid heuristic for the p-median problem,” invited talk, Mathematical Programming in Rio – A conference in honor of Nelson Maculan, Búzios, Brazil, November 2003.
“Some applications of combinatorial optimization in telecommunications,” invited short course, Advanced School and Workshop on Mathematical Techniques and Problems in Telecommunications – MTPT 2003, Tomar, Portugal, September 2003.
“GRASP and path-relinking: Advances and applications,” tutorial lecture, V Metaheuristics International Conference (MIC2003), Kyoto, Japan, August 2003.
“GRASP with path-relinking for the quadratic assignment problem,”V Metaheuristics International Conference (MIC2003), Kyoto, Japan, August 2003.
“Finding approximate solutions for the p-median problem,” invited seminar, Systems Engineering Department, COPPE, Federal University of Rio de Janeiro, Brazil, August 2003.
“Combinatorial optimization in telecommunications,” invited seminar, Systems Engineering Department, COPPE, Federal University of Rio de Janeiro, Brazil, August 2003.
“Finding approximate solutions for the p-median problem,” invited seminar, Computer Science Department, Catholic University of Rio de Janeiro, Brazil, July 2003.
“Combinatorial optimization in telecommunications,” invited talk, Federal Fluminense University (UFF), Niterói, Brazil, June 2003.
“Finding approximate solutions for the p-median problem,” invited lecture, Industrial and Systems Engineering Department, University of Florida, Gainesville, FL, April 2003.
“A genetic algorithm with optimized crossover for OSPF routing on the Internet,” invited talk, INFORMS Annual Meeting San José, San José, California, November 2002.
“Randomized heuristics for the MAX-CUT problem,” INFORMS Annual Meeting San José, San José, California, November 2002.
“A genetic algorithm with optimized crossover for the weight setting problem in OSPF routing,” invited talk, XXXIII Annual Conference of the Operational Research Society of Italy – AIRO2002, L'Aquila, Italy, September 2002.
“Evolutionary computing and the weight setting problem in open shortest path first (OSPF) routing,” invited seminar, Computer Science Department, Catholic University of Rio de Janeiro, Brazil, August 2002.
“Evolutionary computing and the weight setting problem in open shortest path first (OSPF) routing,”Florham Park Mathematics Research Colloquium & Informal Seminar, AT&T Labs Research, Florham Park, New Jersey, July 2002.
“A memetic algorithm for OSPF routing,”6th INFORMS Telecommunitcations Conference, Boca Raton, Florida, March 2002.
“A genetic algorithm for the weight setting problem in OSPF routing,” invited lecture, Mathematics Department, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil, August 2001.
“A genetic algorithm for the weight setting problem in OSPF routing,”Optimization 2001, Aveiro, Portugal, July 2001.
“GRASP with path-relinking and VNS for MAXCUT,”IV Metaheuristics International Conference, Porto, Portugal, July 2001.
“Combinatorial optimization in telecommunications,”Optimization and Industry Conference, invited plenary talk, Great Keppel Island, Queensland, Australia, July 2001.
“GRASP with path-relinking for the 3-index assignment problem,”Workshop on Novel Approaches to Hard Discrete Optimization Problems, invited plenary talk, U. of Waterloo, Waterloo, Canada, April 2001.
“Local search with perturbations for the prize-collecting Steiner tree problem in graphs,”INFORMS Fall Meeting, San Antonio, TX, November 2000.
“The prize collecting Steiner tree problem in graphs: Heuristics and lower bounds,” invited lecture, Industrial and Systems Engineering Department, University of Florida, Gainesville, FL, October 2000.
“Detecting dense subgraphs in massive graphs,”XVII International Symposium on Mathematical Programming, Atlanta, USA, August 2000.
“The prize collecting Steiner tree problem in graphs: Heuristics and lower bounds,” invited lecture, Mathematics Department, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil, July 2000.
“The prize collecting Steiner tree problem in graphs: Heuristics and lower bounds,” invited lecture, Dipartimento di Informatica e Sistemistica, Universitá di Roma “La Sapienza”, Rome, Italy, May 2000.
“The prize collecting Steiner tree problem in graphs: Heuristics and lower bounds,” invited lecture, Dipartimento di Elettronica Informatica e Sistemistica, Universitá della Calabria, Rende, Italy, May 2000.
“Greedy randomized adaptive search procedures,” plenary lecture, ECCO XIII - 13th Meeting of the European Chapter in Combinatorial Optimization, Capri, Italy, May 2000.
“Applied combinatorial optimization in telecommunications,” plenary lecture, IO'2000 - 9th Conference of the Portuguese Operations Research Association, Setúbal, Portugal, April 2000.
“A parallel GRASP for the Steiner problem in graphs using a hybrid local search,”INFORMS Fall Meeting, Philadelphia, PA, November 1999.
“Combinatorial optimization in telecommunications,” invited lecture, III Joint ALIO-EURO Meeting on Applied Combinatorial Optimization, International School of Mathematics “G. Stampacchia,” Erice, Sicily, Italy, November 1999.
“Metaheuristics for combinatorial optimization,” tutorial lecture, CIMPA International School on Advanced Algorithmic Techniques for Parallel Computation with Applications, Natal, Brazil, September 1999.
“GRASP: Greedy randomized adaptive search procedures,” tutorial lecture, III Metaheuristics International Conference (MIC99), Angra dos Reis, Brazil, July 1999.
“GRASP: Greedy randomized adaptive search procedures,” invited lecture, Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, May 1999.
“GRASP: Greedy randomized adaptive search procedures,” invited lecture, IBM T.J. Watson Research Center, Yorktown Heights, NY, April 1999.
“GRASP: Greedy randomized adaptive search procedures,” invited lecture, DIMACS workshop on Large Scale Discrete Optimization in Logistics, Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, New Jersey, USA, February 1999.
“Applied optimization in telecommunications,” invited lecture, Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, February 1999.
“Greedy randomized adaptive search procedures,” invited lecture, VI Latin American Summer School in Operations Research, Mendes, Brazil, January 1999.
“Applied optimization in telecommunications,” invited lecture, VI Latin American Summer School in Operations Research, Mendes, Brazil, January 1999.
“GRASP and an application in telecommunications,” invited conference, XXX Symposium of the Brazilian Operations Research Society, Curitiba, Brazil, November 1998.
“On preconditioners for network interior point methods,”INFORMS Fall Meeting, Seattle, Washington, October 1998.
“On cliques in very large graphs: An application in telecommunications,”INFORMS Fall Meeting, Seattle, Washington, October 1998.
“GRASP: Greedy randomized adaptive search procedures. A meta-heuristic for combinatorial optimization,” Invited tutorial, IX Latin-Iberian-American Conference on Operations Research, Buenos Aires, Argentina, September 1998.
“On cliques in very large graphs: An application in telecommunications,”invited seminar, Institute of Mathematics, Federal University of Rio de Janeiro, Brazil, August 1998.
“On cliques in very large graphs: An application in telecommunications,”invited seminar, Computer Science Department, Catholic University of Rio de Janeiro, Brazil, August 1998.
“Ten years of GRASP: A survey,”Optimization 98, Coimbra, Portugal, July 1998.
“On cliques in very large graphs,”International Conference on Combinatorial and Global Optimization, Crete, Greece, May 1998.
“On cliques in very large graphs,”DIMACS Workshop on External Memory Algorithms and/or Visualization (EMA&VIS), Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, New Jersey, USA, May 1998.
“On large maximum clique problems,”Algorithms and Experiments (ALEX98), Trento, Italy, February 1998.
“A GRASP for job shop scheduling,”INFORMS CSTS Meeting, Carmel, California, January 1998.
“Greedy randomized adaptive search procedure for the Steiner problem in graphs,”DIMACS Workshop on Randomization Methods in Algorithm Design, Princeton, New Jersey, December 1997.
“A GRASP for the feedback vertex set problem,”Invited Seminar, Systems Design Engineering Seminar Series, University of Waterloo, Waterloo, Canada, December 1997.
“Approximate solution of MAX-SAT problems using GRASP,”XVI International Symposium on Mathematical Programming, Lausanne, Switzerland, August 1997.
“A branch and bound algorithm for the quadratic assignment problem using lower bounds based on linear programming,”XVI International Symposium on Mathematical Programming, Lausanne, Switzerland, August 1997.
“An efficient implementation of an interior point method for multicommodity network flows,”XVI International Symposium on Mathematical Programming, Lausanne, Switzerland, August 1997.
“A GRASP for job shop scheduling,”From local to global optimization: Workshop in honor of the 70th birthday of Hoang Tuy, Linkoping, Sweden, August 1997.
“A GRASP for the maximum covering problem,”invited seminar, Department of Electrical Engineering, University of Campinas, Campinas, Brazil, July 1997.
“A GRASP for the maximum covering problem,”invited seminar, Computer Science Department, Catholic University of Rio de Janeiro, Brazil, July 1997.
“An LP-based branch and bound algorithm for the QAP,”invited seminar, Institut Galilée, University of Paris XIII, Paris, France, June 1997.
“An LP-based branch and bound algorithm for the QAP,”invited seminar, CNET, France Telecom, Paris, France, June 1997.
“An LP-based branch and bound algorithm for the QAP,”invited speaker, Conference on High Performance Software for Nonlinear Optimization (HPSNO'97), Ischia, Italy, June 1997.
“A GRASP for the maximum covering problem,”INFORMS Meeting, San Diego, California, May 1997.
“A GRASP for job shop scheduling,”INFORMS Meeting, San Diego, California, May 1997.
“A multicommodity flow approach for global network planning,”INFORMS Meeting, San Diego, California, May 1997.
“An interior point method for multicommodity flows,”INFORMS Meeting, San Diego, California, May 1997.
“A GRASP for the maximum covering problem,”DIMACS Workshop on Network Design and Facility Location, Princeton, New Jersey, April 1997.
“A GRASP for the maximum covering problem,”invited seminar, Department of Operations Research and Statistics, University of Catalunya, Barcelona, Spain, December 1996.
“Solving network flow problems with interior point methods,” Department of Operations Research and Statistics, University of Catalunya, Barcelona, Spain, December 1996.
“A GRASP for the maximum covering problem,”invited seminar, Institute of Telecommunications, University of Coimbra, Coimbra, Portugal, December 1996.
“A GRASP for the biquadratic assignment problem,”INFORMS, Atlanta, USA, November 1996.
“Designing and reporting on computational experiments with heuristic methods,”invited seminar, Department of Computer Science, Catholic University, Rio de Janeiro, Brazil, September 1996.
“Tutorial on Combinatorial Optimization,”Three day invited tutorial, Department of Mathematics, Federal University of Ceará, Fortaleza, Brazil, September 1996.
“Interior point methods for network flows,”Invited Seminar, Centro de Pesquisas em Energia Elétrica (CEPEL), Rio de Janeiro, Brazil, August 1996.
“Recent advances in mathematical programming,”VIII Latin-Iberian-American Conference on Operations Research, Rio de Janeiro, Brazil, August 1996.
“Solving network flow problems with interior point methods,”International Symposium on Optimization and Computation, Hayama, Japan, August 1996.
“A GRASP for graph planarization,”IFORS'96, Vancouver, B.C., Canada, July 1996.
“An LP-based branch and bound algorithm for the QAP,”8th SIAM Conference on Discrete Mathematics, Baltimore, MD, USA, June 1996.
“A GRASP for graph planarization,”8th SIAM Conference on Discrete Mathematics, Baltimore, MD, USA, June 1996.
“A truncated primal-infeasible dual-feasible network interior point method,”5th SIAM Conference on Optimization, Victoria, B.C., Canada, May 1996.
“Using linear programming to help solve quadratic assignment problems,”Workshop on Semidefinite Programming and Interior-Point Approaches for Combinatorial Optimization Problems, Fields Institute, Toronto, Canada, May 1996.
“Tutorial on Optimization,”Tyecin Systems User's Group Meeting, San Jose, USA, May 1996.
“Using linear programming to help solve quadratic assignment problems,”Combinatorial optimization - CO96, London, U.K., March 1996.
“A parallel GRASP for MAXSAT,”Parallel optimization colloquium - POC96, Versailles, France, March 1996.
“A parallel GRASP for MAXSAT,”DIMACS Workshop on SATISFIABILITY PROBLEM: THEORY AND APPLICATIONS, Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, New Jersey, USA, March 1996.
“Interior Point Algorithm for Approximate Solution of Maximum Satisfiability Problem,”DIMACS Workshop on SATISFIABILITY PROBLEM: THEORY AND APPLICATIONS, Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, New Jersey, USA, March 1996.
“A GRASP for graph planarization,”INFORMS, New Orleans, USA, November 1995.
“A GRASP for the biquadratic assignment problem,”INFORMS, New Orleans, USA, November 1995.
“A LP-based branch and bound algorithm for the quadratic assignment problem,”INFORMS, New Orleans, USA, October 1995.
“A truncated primal-infeasible dual-feasible network interior point method,”INFORMS, New Orleans, USA, October 1995.
“A GRASP for graph planarization,”Systems and Industrial Engineering Seminar Series, University of Florida, Gainesville, USA, September 1995.
“Using interior point methods to solve large scale network optimization,”III International Conference on Industrial and Applied Mathematics, Hamburg, Germany, July 1995.
“A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming,”INFORMS International Meeting, Singapore, July 1995.
“A GRASP for graph planarization,”INFORMS International Meeting, Singapore, July 1995.
“Computing lower bounds for the quadratic assignment problem with an interior point method for linear programming,”INFORMS International Meeting, Singapore, July 1995.
“A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming,”Conference on State of the Art in Global Optimization: Computational Methods and Applications, Princeton University, April 1995.
“Computational linear programming – A tutorial,” Two-day tutorial, II Latin American Summer School in Operations Research, Mendes, Brazil, January 1995.
“Greedy Randomized Adaptive Search Procedures,” Closing plenary session, II Latin American Summer School in Operations Research, Mendes, Brazil, January 1995.
“Computational linear programming,” Research seminar series, National Laboratory for Scientific Computing – LNCC, Rio de Janeiro, Brazil, January 1995.
“Computational linear programming – State of the art,” Closing plenary session, XXVI Symposium of the Brazilian Operations Research Society, Florianópolis, Brazil, December 1994.
“Recent results in linear programming,” Two-day tutorial, XXVI Symposium of the Brazilian Operations Research Society, Florianópolis, Brazil, December 1994.
“Recent advances in network optimization,”International Symposium on Network Design and Management, Viña del Mar, Chile, November 1994.
“Interior point methods for network optimization,”Systems and Industrial Engineering Seminar Series, University of Florida, Gainesville, USA, September 1994.
“Interior point methods for network optimization,”XV International Symposium of the Mathematical Programming Society, Ann Arbor, USA, August 1994.
“Computing lower bounds for the quadratic assignment problem with an interior point method for linear programming,”XV International Symposium of the Mathematical Programming Society, Ann Arbor, USA, August 1994.
“A GRASP for Satisfiability,”XV International Symposium of the Mathematical Programming Society, Ann Arbor, USA, August 1994.
“Interior point methods for network optimization,”Faculty Seminar on Optimization: Theory & Practice, Center for Advanced Studies, University of Iowa, Iowa City, USA, August 1994.
“A GRASP for Satisfiability,”TIMS XXXII, Anchorage (Alaska), USA, June 1994.
“A GRASP for Satisfiability,”TIMS / ORSA, Boston, USA, April 1994.
“Interior point methods for network optimization,”ORSA CSTS Conference, Williamsburg (Virginia), USA, January 1994.
“A GRASP for Satisfiability,”3rd International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale (Florida), USA, January 1994.
“Using GRASP for the quadratic assignment problem,”ORSA / TIMS, Phoenix, USA, November 1993.
“A GRASP for Satisfiability,”ORSA / TIMS, Phoenix, USA, November 1993.
“A GRASP for Satisfiability,”2nd DIMACS Implementation Challenge: Clique, Coloring, and Satisfiability, Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, New Jersey, USA, October 1993.
“Efficient implementation of a network interior point method,”Netflow'93, San Miniato, Italy, October 1993.
“Integer and linear programming models of a ADCS network design problem,”Networks and Systems Performance Symposium, AT&T Bell Laboratories, Holmdel (NJ), USA, September 1993.
“An interior point approach for Boolean vector function synthesis,”36th Midwest Conference on Circuits and Systems, Detroit, USA, August 1993.
“Greedy randomized adaptive search procedures,”Electrical Engineering Seminar Series, Imperial College of Science and Technology, London, England, July 1993.
“Efficient implementation of a network interior point method,”IFORS / 93, Lisbon, Portugal, July 1993.
“GRASP for set covering and MAX-SAT,”IFORS / 93, Lisbon, Portugal, July 1993.
“A greedy randomized adaptive search procedure for the quadratic assignment problem,”IFORS / 93, Lisbon, Portugal, July 1993.
“A greedy randomized adaptive search procedure for the quadratic assignment problem,”DIMACS Workshop on the Quadratic Assignment Problem, Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, New Jersey, USA, May 1993.
“A greedy randomized adaptive search procedure for the quadratic assignment problem,”TIMS / ORSA, Chicago, USA, May 1993.
“A globally convergent interior point network flow method: Identifying the optimal primal-dual structure,”TIMS / ORSA, Chicago, USA, May 1993.
“Greedy randomized adaptive search procedures,”DIMACS Workshop on Solving Hard Combinatorial Optimization Problems, Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, New Jersey, March 1993.
“A globally convergent interior point network flow method: Identifying the optimal primal-dual structure,”Workshop on Large Scale Optimization, University of Florida, Gainesville, USA, February 1993.
“Advances in an implementation of a network interior point method,”ORSA / TIMS, San Francisco, USA, November 1992.
“Treating free variables in dual form interior point algorithms,”ORSA / TIMS, San Francisco, USA, November 1992.
“Advances in an implementation of a network interior point method,”Operations Research Seminar Series, Operations Research Group, Dept. of Mechanical Engineering, The University of Texas, Austin, USA, October 1992.
“A interior point approach to Boolean vector function synthesis,”VI Latin-Iberian-American Conference on Operations Research, Mexico City, Mexico, October 1992.
“Efficient implementation of a network interior point method,”Electrical Engineering Seminar Series, Imperial College of Science and Technology, London, England, July 1992.
“A interior point approach to Boolean vector function synthesis,”TIMS XXXI, Helsinki, Finland, June 1992.
“Advances in interior point approaches to integer programming,”TIMS XXXI, Helsinki, Finland, June 1992.
“Efficient implementation of a network interior point method,”III Stockholm Optimization Days, Royal Institute of Technology, Stockholm, Sweden, June 1992.
“Efficient implementation of a network interior point method,”Computer and Electrical Engineering Seminar Series, University of Waterloo, Waterloo, Canada, June 1992.
“Efficient implementation of a network interior point method,”IV SIAM Conference on Optimization, Chicago, USA, May 1992.
“Efficient implementation of a network interior point method,”TIMS / ORSA, Orlando, USA, April 1992.
“A interior point approach to Boolean vector function synthesis,”TIMS / ORSA, Orlando, USA, April 1992.
“Efficient implementation of a network interior point method,”Mathematical Sciences Seminar Series, Rensselaer Polytechnic Institute, Troy, USA, March 1992.
“Efficient implementation of a network interior point method,”Operations Research and Statistics Seminar Series, Princeton University, Princeton, USA, February 1992.
“Efficient implementation of a network interior point method,”Systems and Industrial Engineering Seminar Series, University of Florida, Gainesville, USA, February 1992.
“Efficient implementation of a network interior point method,”Large Scale Systems Seminar, Department of Industrial Engineering and Operations Research, University of California, Berkeley, USA, January 1992.
“A interior point approach to Boolean vector function synthesis,”TIMS / ORSA, Anaheim, USA, November 1991.
“An efficient implementation of a network interior point method,”Operations Research Seminar Series, Operations Research Department, George Washington University, Washington D.C., USA, October 1991.
“Computational investigation of an interior point linear programming algorithm for minimum cost network flow,”The 1st DIMACS International Algorithm Implementation Challenge, DIMACS, New Brunswick, USA, October 1991.
“A dual affine scaling algorithm for network flow,”TIMS XXX, Rio de Janeiro, Brazil, July 1991.
“A interior point approach to Boolean function synthesis,”TIMS XXX, Rio de Janeiro, Brazil, July 1991.
“Acceleration techniques for interior point linear programming algorithms,”TIMS XXX, Rio de Janeiro, Brazil, July 1991.
“A interior point approach to Boolean function synthesis,”ORSA / TIMS, Nashville, USA, May 1991.
“A dual affine scaling algorithm for network flow,”ORSA / TIMS, Nashville, USA, May 1991.
“TUTORIAL: Greedy Randomized Adaptive Search Procedures,”ORSA / TIMS, Nashville, USA, May 1991.
“A interior point approach to Boolean function synthesis,”Operations Research Seminar Series, Operations Research Group, Dept. of Mechanical Engineering, The University of Texas, Austin, USA, March 1991.
“A dual affine scaling algorithm for network flow,”Systems and Industrial Engineering Seminar, University of Arizona, Tucson, USA, November 1990.
“Implementation of interior point algorithms: A tutorial,”Systems Engineering and Computer Science Seminar, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil, September 1990.
“Implementation of interior point algorithms: A tutorial,”V Latin-Iberian-American Conference on Operations Research, Buenos Aires, Argentina, September 1990.
“Implementation of interior point algorithms for network flows,”SIAM Conference, Chicago, USA, July 1990.
“An interior point approach to graph partitioning,”SIAM Conference, Chicago, USA, July 1990.
“An interior point algorithm for zero-one integer programming,”IFORS / 90, Athens, Greece, June 1990.
“An interior point algorithm for zero-one integer programming,”Management Sciences Seminar Series, Imperial College of Science and Technology, London, England, July 1990.
“Computational experience with an interior point algorithm on the Satisfiability problem,”MPS Conference on Integer Programming and Combinatorial Optimization, Waterloo University, Canada, May 1990.
“Implementation of interior point algorithms for network flows,”ORSA / TIMS, Las Vegas, USA, April 1990.
“An interior point algorithm for zero-one integer programming,”International Symposium on Interior Point Methods: Theory and Practice, Schreveningen, Netherlands, January 1990.
“An interior point algorithm for zero-one integer programming,”Operations Research Seminar Series, Operations Research Group, Dept. of Mechanical Engineering, The University of Texas, Austin, USA, November 1989.
“An interior point algorithm for zero-one integer programming,”Graduate School of Industrial Management Seminar Series, Graduate School of Industrial Management, Carnegie-Mellon University, Pittsburgh, USA, October 1989.
“Computational experience with an interior point algorithm on the Satisfiability problem,”TIMS / ORSA, New York City, USA, October 1989.
“A greedy randomized adaptive search procedure for maximum independent set,”TIMS / ORSA, New York City, USA, October 1989.
“Implementation and testing of Karmarkar's algorithm for linear programming,”Brazilian Mathematics Colloquium, Instituto de Matemática Pura e Aplicada (IMPA), Rio de Janeiro, Brazil, July 1989.
“An interior point algorithm for zero-one integer programming,”Latin American Conference on Informatics, Santiago, Chile, July 1989.
“An interior point algorithm for zero-one integer programming,”III SIAM Conference on Optimization, Boston, USA, April 1989.
“An interior point algorithm for zero-one integer programming,”ORSA / TIMS, Denver, USA, October 1988.
“A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension,”ORSA / TIMS, Denver, USA, October 1988.
“An interior point algorithm for zero-one integer programming,”13th International Symposium of the Mathematical Programming Society, Tokyo, Japan, September 1988.
“Implementation and testing of Karmarkar's algorithm for linear programming,”13th International Symposium of the Mathematical Programming Society, Tokyo, Japan, September 1988.
“A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension,”ACM-AMS-SIAM Conference on the Progress of Mathematical Programming, Bowdoin College, Brunswick (Maine), USA, May 1988.
“Shop floor scheduling of semiconductor wafer manufacturing,”Operations Research Seminar Series, Operations Research Group, Dept. of Mechanical Engineering, The University of Texas, Austin, USA, March 1988.
“Testing interior point algorithms on randomly generated degenerate linear programs,”TIMS / ORSA, Washington, D.C., USA, April 1988.
“A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension,”SIAM Conference on Discrete Mathematics, San Francisco, USA, March 1988.
“Implementation and testing of Karmarkar's algorithm for linear programming,”Operations Research Seminar Series, Operations Research Group, Dept. of Mechanical Engineering, The University of Texas, Austin, USA, November 1987.
“Preprocessing the input data for Karmarkar's algorithm for linear programming,”ORSA / TIMS, St. Louis, USA, October 1987.
“Closed-loop job release control for VLSI circuit manufacturing,”SRC Conference on VLSI Manufacturing, MIT, Cambridge (MA), USA, June 1987.
“Data structures for Karmarkar's algorithm for linear programming,”II SIAM Conference on Optimization, Houston, USA, May 1987.
“Data structures for Karmarkar's algorithm for linear programming,”TIMS / ORSA, New Orleans, USA, April 1987.
“Data structures for computing the search direction in Karmarkar's algorithm for linear programming,”ORSA / TIMS, Miami, USA, October 1986.
“An implementation of Karmarkar's algorithm for linear programming,” Talk given by Ilan Adler at TIMS / ORSA, Los Angeles, USA, April 1986.
“Karmarkar's algorithm for linear programming,”Invited Seminar, Centro de Pesquisas em Energia Elétrica (CEPEL), Rio de Janeiro, Brazil, December 1984.
“Implementation and testing of a primal-dual algorithm for the assignment problem,”XIII Brazilian Operations Research Symposium, Rio de Janeiro, Brazil, October 1980.