1. Aarts, E., Lenstra, J.K., Local Search in Combinatorial Optimization, J.Wiley, New York, 1997.
2. Aho, A.V._, Hoperoft, J.E., Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
3. Ahuja, M., Zhu, Y., An O(logn) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube, Information Processing Letters 35, 1990, 7–11.
4. Alda, W., Dzwinel, W., Kitowski, J., Moscinski, J., Yuen, D.A., Penetration mechanics via molecular dynamics. Research Report UMSI 93/58, University of Minessota Supercomputing Institute, 1993.
5. Anger, F.D., Hwang, J., Chow, Y., Scheduling with sufficiently loosely coupled processors, J. Parallel Distributed Comput. 9, 1990, 87–92.