Improving the performance of enumerative search methods-I. Exploiting structure and intelligence
References (15)
Future paths of integer programming and links to artificial intelligence
Computers Ops Res.
(1986)Resolution vs cutting plane solution of inference problems: some computational experience
Ops Res. Lett.
(1988)- et al.
Modeling and integer programming techniques applied to propositional calculus
Computers Ops Res.
(1990) - et al.
New approaches for heuristic search: a bilateral linkage with artificial intelligence
Eur. J. Ops Res.
(1989) Structural analysis of local search heuristics in combinatorial optimization
Computers Ops Res.
(1987)- et al.
A decomposition algorithm for the single machine total tardiness problem
Ops Res. Lett.
(1982) - et al.
A greedy heuristic for the mean tardiness sequencing problem
Computers Ops Res.
(1994)
There are more references available in the full text version of this article.
Cited by (0)
- †
Adam Fadlalla holds an M.B.A. from Miami University (Ohio), an M.Sc. in computer science, and Ph.D. in Information Systems from the University of Cincinnati. He is currently an Assistant Professor of Computer and Information Systems at Cleveland State University. His research interests include optimization and applications of artificial intelligence. He is an active business consultant in the Middle East.
Copyright © 1995 Published by Elsevier Ltd.