Name
Papers
Collaborators
WILLIAM E. HART
36
64
Citations 
PageRank 
Referers 
1028
141.71
2678
Referees 
References 
424
275
Search Limit
1001000
Title
Citations
PageRank
Year
A survey of software implementations used by application codes in the Exascale Computing Project00.342022
Performance Portability in the Exascale Computing Project: Exploration Through a Panel Series00.342021
PEBBL: an object-oriented framework for scalable parallel branch and bound80.552015
PySP: modeling and solving stochastic programs in Python.161.012012
Real-time inversion in large-scale water networks using discrete measurements.20.442012
Pyomo: modeling and solving mathematical programs in Python512.382011
US Environmental Protection Agency Uses Operations Research to Reduce Contamination Risks in Drinking Water91.002009
Limited-Memory Techniques for Sensor Placement in Water Distribution Networks50.492007
EXACT: the experimental algorithmics computational toolkit00.342007
Robust optimization of contaminant sensor placement for community water systems151.962006
Rethinking the design of real-coded evolutionary algorithms: Making discrete choices in continuous search domains20.412005
A Filter-Based Evolutionary Algorithm for Constrained Optimization60.552005
Opportunities for Combinatorial Optimization in Computational Biology643.652004
Editorial Introduction Special Issue on Memetic Algorithms60.522004
Locally-adaptive and memetic evolutionary pattern search algorithms70.782003
On The Convergence Properties Of A Simple Self-adaptive Evolutionary Algorithm20.462002
A Convergence Analysis of Unconstrained and Bound Constrained Evolutionary Pattern Search151.262001
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms61.672000
Comparing Evolutionary Programs And Evolutionary Pattern Search Algorithms: A Drug Docking Application100.851999
On the Intractability of Protein Folding with a Finite Alphabet of Amino Acids141.381999
Measurement and classification of retinal vascular tortuosity384.901999
Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search100.781998
On the Application of Evolutionary Pattern Search Algorithms30.471998
Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function50157.181998
On the computational complexity of sequence design problems123.891997
Automated measurement of retinal vascular tortuosity.64.251997
A Comparison of Global and Local Search Methods in Drug Docking131.131997
A Generalized Stationary Point Convergence Theory for Evolutionary Algorithms61.291997
Lattice and off-lattice side chain models of protein folding (extended abstract): linear time structure prediction better than 86% of optimal324.541997
Robust Proofs of NP-Hardness for Protein Folding: General Lattices and Energy Potentials.486.011997
Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal6916.451996
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract)56.571996
A Stationary Point Convergence Theory for Evolutionary Algorithms51.331996
A Theoretical Comparison of Evolutionary Algorithms and Simulated Annealing40.561996
Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract)10.361995
Optimising an Arbitrary Function is Hard for the Genetic Algorithm3711.621991