``Consider
everything.
Keep the
good.
Avoid evil
whenever you notice it.''
(1 Thess. 5:21-22)
This file is part of my global optimization web site. It contains sections on
Tom Epperly
(chemical engineering applications)
Betty Eskow
(molecular conformation problems)
Vitaliy Feoktistov (differential evolution)
Chris Floudas
(constrained global optimization; nonlinear mixed
integer programming; process synthesis, design and control;
computational chemistry)
Efim Galperin
(global optimization in game theory)
J\uuml;rgen Garloff
(polynomial problems, interval methods)
Saied Ghannadan
(global optimization of network flows)
Fred Glover
(tabu search)
David Goldberg
(genetic algorithms)
Susana Gomez
(tunneling methods)
Eric Gourdin
(bilinear and Lipschitz programming)
Harvey J. Greenberg
(analysis, modeling, search)
John Grefenstette
(evolutionary computation, machine learning, computational biology)
Andreas Griewank
(automatic differentiation)
Ignacio Grossmann
(chemical engineering applications)
Jun Gu
(satisfiability, VLSI circuit design, etc.)
Hans-Martin Gutmann
(global optimization using radial basis functions)
Beidi Hamma
(Global optimization of aircraft and spacecraft trajectories)
Nikolaus Hansen
(Covariance adapted evolutionary optimization)
William E. Hart
(genetic algorithms, protein folding)
Bernd Hartke
(global optimization of atomic and molecular clusters)
Teresa Head-Gordon
Eligius Hendrix
(global optimization in agricultural and environmental sciences)
Didier Henrion
(Senmidefinite relaxations of global optimization problems)
José Fernández Hernández
(Global optimization in facility location problems)
André van der Hoek
(global optimization of molecular potentials)
John Hooker
(Logic-Based Methods for Optimzation)
Reiner Horst
(dc-methods)
Lester Ingber
(simulated annealing)
Benjamin Ivorra
(global optimization using differential equations; industrial
applications)
Ronald Van Iwaarden
(interval methods, automatic differentiation)
Stephen Jacobsen
(reverse convex programming)
Jeff Joines
(genetic algorithms)
Joaquim Júdice
(linear complementarity problems)
David Karger
(minimum cuts, etc.)
Stefan Karisch
(nonlinear approaches to combinatorial optimization)
David E. Kaufman
(random search)
Andy Keane
(Evolutionary Optimization)
R. Baker Kearfott
(interval methods for factorable constraints)
Olaf Knüppel
(interval methods)
John Koza
(genetic programming)
Zenon Kulpa
(interval analysis of mechanical structures)
Manuel Laguna
(Tabu and scatter search)
Jean-Bernard Lasserre
(planning and scheduling)
Rodolphe Le Riche
(kriging-based and evolutionary optimization)
Anthony P. Leclerc
(parallel interval methods)
Eva K. Lee
(mixed integer programming)
Mark Levin
(combinatorial optimization and applications)
Dmitrii Makarov
(genetic algorithms in quantum mechanics)
Ernesto Martins
(path and flow algorithms)
Anil Menon (replicators, majorization and genetic algorithms)
Frédéric Messine
(deterministic global optimization)
Zbigniew Michalewicz (evolutionary computation)
Melanie Mitchell (genetic algorithms)
Audris Mockus
(stochastic global optimization)
Marcel Mongeau
(chemical and phase equilibrium problems, exploiting structure)
Jorge Moré
(large-scale optimization, local and global)
Khosrow Moshirvaziri
(bilevel and concave programming)
Pablo Moscato (memetic algorithms)
Sreerama K. Murthy (decision trees)
Rafi Muhanna (intervals in finite elements)
Prasanth Nair
(evolutionary computation; structural system identification)
Ivo Nowak
(global quadratically constraine quadratic programming)
Ed Oblow
Panos Pardalos
(constrained global optimization)
Pablo Parrilo
(semidefinite relaxations of polynomial programs)
Gabor Pataki
(mixed integer and semidefinite programming)
Stefano De Pascale
(constraint satisfaction, interval analysis)
Andy Phillips
(protein folding)
Janos D. Pinter
(continuos and Lipschitz global optimization; engineering and
environmental applications)
Patrick Prosser
(constraint satisfaction, scheduling)
Raychel Ramoldov
(simulated annealing)
Dietmar Ratz
(interval techniques)
Franz Rendl
(nonlinear approaches to combinatorial optimization)
Mauricio Resende
(network flow, quadratic assignment, GRASP)
Nicolas Roddier
(global optimization via neural networks and D.C. programming)
Maurice Rojas
(global solution of polynomial systems)
Hans Roubos
(evolutionary optimization, fuzzy control)
Siegfried Rump
(interval techniques)
Alexander Rusakov
(concave programming)
Gennady Ryzhikov
(global optimization in inverse modeling)
Nikos Sahinidis (mixed integer nonlinear programming)
Martin Savelsbergh
(mixed integer programming)
Dirk Schlierkamp-Voosen
(genetic algorithms)
Bobby Schnabel
(nonlinear equations; parallelization; applications
in molecular chemistry)
Fabio Schoen
(stochastic global optimization)
Matt Schonlau
(global optimization of computer experiments, `space')
Hans-Paul Schwefel
(evolutionary optimization)
Yaroslav Sergeyev
(Lipschitz global optimization, engineering applications)
Gregory Seront
(evolutionary optimization)
James Spall
(stochastic noisy global optimization)
Rainer Storn (genetic algorithms)
Simon Streltsov
(stochastic optimization)
Ray L. Sun
(chemical system design)
Mohit Tawarmalani
(branch and reduce methods)
Aimo Törn
(stochastic clustering methods)
Josef Tvrdik
(stochastic global optimization in regression)
Francois Vanderbeck
(cutting, packing, scheduling)
Sami Viitanen
(stochastic optimization)
Michael Wolfe
(interval methods)
Henry Wolkowicz
(quadratic assignment; combinatorial optimization via semidefinite
relaxation, etc.)
Zhijun Wu
(distance geometry and molecular systems)
Zelda Zabinsky (stochastic global optimization)
Home Pages of SIAM/OPT Activity Group Members
Operations Research People,
an extensive list from INFORMS
Interval Methods
Regularization
Protein Folding
Recent Papers and Preprints
my home page
(http://www.mat.univie.ac.at/~neum)
Arnold Neumaier (Arnold.Neumaier@univie.ac.at)