Logistics Optimization at Amazon: Operations Research in Action, invited virtual talk, Department of Industrial Engineering, Pontifical Catholic U. of Rio de Janeiro, Brazil, May 21, 2021

Operations Research at Amazon, 2021 INFORMS PNW Regional Analytics Conference, invited virtual plenary talk, May 14, 2021

Biased random-key genetic algorithms: Global optimization solutions from random building blocks, invited talk, Amazon ATS Science, Luxembourg, April 27, 2021

GRASP - Greedy Randomized Adaptive Search Procedures: Some recent advances, invited talk, Amazon ATS Science, Luxembourg, April 15, 2021

2021 INFORMS Prize - Amazon, 2021 INFORMS Business Analytics Conference, invited virtual talk with T.L. Jacobs and N. Noyan-Bulbul, April 14, 2021

Logistics Optimization at Amazon: Big Data & Operations Research in Action, invited virtual talk, Isenberg School of Management, University of Massachusetts, Amherst, Massachusetts, March 5, 2021

A hybrid genetic algorithm for road congestion minimization, Contributed talk, 2009 INFORMS Annual Meeting, San Diego, California, October 11-14, 2009 [ PDF ].

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 [ PDF ].

GRASP with evolutionary path-relinking for the antibandwidth problem, Invited talk, 2009 INFORMS Annual Meeting, San Diego, California, October 11-14, 2009 [ PDF ].

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, Septemeber 14-16, 2009 [ PDF file ].

GRASP with path-relinking for the generalized quadratic assignment problem, VIII Metaheuristics International Conference (MIC 2009), Hamburg, Germany, July 16, 2009 [ PDF ].

GRASP with evolutionary path-relinking for the antibandwidth problem, VIII Metaheuristics International Conference (MIC 2009), Hamburg, Germany, July 14, 2009 [ PDF ].

Algorithms for node placement in path-disjoint network monitoring, Invited lecture, Computer Science Institute, U. Fed. Fluminenese (UFF), Niterói, RJ, Brazil, May 14, 2009 [ PDF ].

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 [ PDF ].

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 [ PDF ].

Algorithms for node placement in path-disjoint network monitoring, Invited lecture, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, November 13, 2008 [ PDF file ].

Metaheuristic hybridization with GRASP, Invited lecture, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, November 11, 2008 [ PDF file ].

Metaheuristic hybridization with GRASP, Invited tutorial lecture, INFORMS Annual Meeting, Washington, D.C., October 12-15, 2008 [ PDF file ].

Algorithms for node placement in path-disjoint network monitoring, Invited plenary lecture, XXXIX Annual Conference of the Italian Operational Research Society (AIRO 2008), Ischia, Italy, September 8-11, 2008 [ PDF file ].

A memetic algorithm for optimizing routing in networks using exponential flow splitting, 18th Triennial Conference of the International Federation of Operational Research Societies (IFORS 2008), Standton, Johannesburg, South Africa, July 13-18, 2008 [ PDF file ].

Local search for the maximum independent set, 7th International Workshop on Experimental Algorithms (WEA2008), Provincetown, Cape Cod, MA, talk given by co-author Renato Werneck on June 2, 2008 [ PDF file ].

Efficient implementations of heuristics for routing and wavelength assignment, 7th International Workshop on Experimental Algorithms (WEA2008), Provincetown, Cape Cod, MA, June 1, 2008 [ PDF file ].

Metaheuristics in network design, Invited plenary lecture, 7th International Workshop on Experimental Algorithms (WEA2008), Provincetown, Cape Cod, MA, May 31, 2008 [ PDF file ].

A genetic algorithm with random keys for node placeent in path-disjoint network monitoring, Invited lecture, DIMACS/DyDAn Workshop on Internet Tomography, DIMACS, Rutgers Univeristy, Piscataway, NJ, May 15, 2008 [ PDF file ].

Metaheuristics in network design, Invited lecture, Management Sciences Seminar, Management Science Department, Univeristy of Iowa, Iowa City, Iowa, May 9, 2008 [ PDF file ].

A random-keys genetic algorithm for node placement in path-disjoint network monitorng, Invited plenary lecture, Sensors 2008: Theory, Algorithms, and Applications, University of Florida, Engineering Education Facility (REEF), Shalimar, Florida, April 24, 2008 [ PDF file ].

Metaheuristics and network design, Invited tutorial lecture, Network design workshop, Ninth INFORMS Telecommunications Conference, University of Maryland, College Park, Maryland, March 29, 2008 [ PDF file ].

A memetic algorithm for routing optimization using exponential flow splitting, Ninth INFORMS Telecommunications Conference, University of Maryland, College Park, Maryland, March 27-29, 2008 [ PDF file ].

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 [ PDF file ].

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 [ PDF file | Audio visual ].

GRASP with path-relinking for network migration scheduling, INFORMS Annual Meeting Seattle, Washington, November 4-7, 2007 [PDF file].

A hybrid heuristic for the p-median problem, INFORMS Annual Meeting Seattle, Washington, November 4-7, 2007 [PDF file].

A short course on greedy randomized adaptive search procedures (GRASP), XXXIX Symposium of the Brazilian Operational Research Society (XXXIX SBPO), Fortaleza, Brazil, August 28-31, 2007 [PDF file].

GRASP with evolutionary path-relinking, Seventh Metaheuristics International Conference (MIC 2007), Montréal, Canada, June 25-29, 2007 [PDF file].

Network migration scheduling, Cookie talk, Internet and Network Systems Research Center, AT&T Labs Research, Florham Park, New Jersey, June 7, 2007 [PDF file].

GRASP with path-relinking for network migration scheduling, International Network Optimization Conference (INOC 2007), Spa, Belgium, April 22-25, 2007 [PDF file].

Some issues in the optimization of Internet traffic, Invited lecture, Informatics Institute, Federal University of Rio Grande do Sul, Porto Alegre, Brazil, March 20, 2007 [PDF file].

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 12-15, 2007 [PDF file].

GRASP for continuous global optimization, Invited lecture, 2nd International Conference on Complementarity, Duality, and Global Optimization in Science and Engineering, University of Florida, Gainesville, March 1, 2007 [PDF file].

Some optimization problems in Internet traffic, Invited lecture, Production Engineering Department, University of São Paulo, São Paulo, Brazil, August 17, 2006.

Some optimization problems in Internet traffic, Invited lecture, Computer Science Department, Federal Fluminense University, Niterói, Brazil, August 14, 2006.

Global optimization by continuous GRASP, 19th International Symposium on Mathematical Programming (ISMP 2006), Rio de Janeiro, Brazil, July 30 - August 4,2006 [PDF file].

Global optimization by continuous GRASP, 21th European Conference on Operational Research (EURO 2006), Reykjavik, Iceland, July 2-5, 2006 [PDF file].

Some issues in Internet traffic optimization, DIMACS Workshop on Computational Optimization and Logistics Challenges in the Enterprise, ExxonMobil Research & Engineering, Annandale, NJ, April 19-21, 2006 [PDF file].

Survivable composite-link IP network design with OSPF routing, Eighth INFORMS Telecommunications Conference, Dallas, Texas, March 30 - April 1, 2006 [PDF file].

A GRASP for PBX telephone migration scheduling, Eighth INFORMS Telecommunications Conference, Dallas, Texas, March 30 - April 1, 2006 [PDF file].

Solving covering problems with a heuristic for the p-median problem, Invited talk, XXXVI Annual Conference of the Italian Operational Research Society, Camerino, Italy, September 2005 [PDF file].

Combinatorial optimization for design and operations of telecommunication systems, Opening plenary talk, XXXVI Annual Conference of the Italian Operational Research Society, Camerino, Italy, September 2005 [PDF file].

A GRASP heuristic for the cooperative communication problem in ad hoc networks, VI Metaheuristics International Conference, Vienna, Austria, August 2005 [PDF file].

Computational mathematics and operations research in telecommunications, Plenary talk, First North-Northeast Meeting on Operations Research and Computational Mathematics, Maceió, Brazil, July 2005 [PDF file].

Optimal design and operations of telecommunication systems, Plenary talk, 7th International Conference on Industrial Logistics (ICIL'2005), Montevideo, Uruguay, February 2005 [PDF file].

A hybrid multistart heuristic for the uncapacitated facility location problem, 9th INFORMS Computing Society Conference, Annapolis, MD, January 2005 [PDF file].

GRASP with path-relinking for the quadratic assignment problem, Third International Workshop on Efficient and Experimental Algorithms, Angra dos Reis, Brazil, May 2004 [PDF file | DjVu file].

A hybrid multistart heuristic for the uncapacitated facility location problem, Invited talk, Multiscale optimization: Methods and Applications, University of Florida, Gainesville, FL, February 2004 [PDF file | DjVu file].

Some applications of combinatorial optimization in telecommunications, Invited short course, Advanced School and Workshop on Mathematical Techniques and Problems in Telecommunications, Tomar, Portugal, September 2003 [PDF file].

GRASP and path-relinking for the quadratic assignment problem, Fifth Metaheuristics International Conference (MIC2003), Kyoto, Japan, August 2003 [PDF file | DjVu file].

GRASP and path-relinking: Advances and applications, Tutorial lecture, Fifth Metaheuristics International Conference (MIC2003), Kyoto, Japan, August 2003 [PDF file | DjVu file].

Finding approximate solutions for the

Combinatorial optimization in telecommunications, Invited lecture, Systems Engineering Department, COPPE, Federal University of Rio de Janeiro, Brazil, August 2003 [PDF file].

Finding approximate solutions for the

Combinatorial optimization in telecommunications, Invited lecture, Computer Science Department, Federal Fluminense University, Niterói, Brazil, June 2003.

Finding approximate solutions for the *p*-median
problem,
Invited lecture, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, April 2003 [PDF
file | DjVu file].

On the implementation of a swap-based local search procedure for the *p*-median problem, Talk given by co-author Renato Werneck at ALENEX'03, Baltimore, Maryland, January 2003 [PDF
file].

Speeding up dynamic shortest path algorithms, Talk given by co-author Luciana Buriol at INFORMS Annual Meeting San José, San José, California, November 2002 [PDF file].

A genetic algorithm with optimized crossover for OSPF routing in the Internet, INFORMS Annual Meeting San José, San José, California, November 2002 [PDF file].

Randomized heuristics for the MAX-CUT problem, INFORMS Annual Meeting San José, San José, California, November 2002 [PDF file].

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 [PDF file].

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, Sixth INFORMS Telecom, 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 [PDF file].

Combinatorial optimization in telecommunications, Optimization and Industry Conference, invited plenary talk, Great Keppel Island, Queensland, Australia, July 2001 [PDF file].

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 [PDF file].

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 [PDF file].

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 [PDF file].

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 [PDF file].

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 [PDF file].

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.

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 [ PDF file: 168kb ] .

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, Third 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, Second 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 First 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.

An 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.

An interior point approach to Boolean function synthesis, Operations Research Seminar Series, 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.

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.

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.

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, 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.