Journal of the ACM Bibliography

Walter H. Kohler and Kenneth Steiglitz. Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems. Journal of the ACM, 21(1):140-156, January 1974. [BibTeX entry]

Additional Key Words and Phrases: discrete optimization, branch-and-bound implicit enumeration, algorithms, permutation problems, sextuple characterization, computational requirements, theoretical comparison

Selected papers that cite this one

Walter H. Kohler and Kenneth Steiglitz. Exact, approximate, and guaranteed accuracy algorithms for the flow-shop problem n/2/f/\bar{F}. Journal of the ACM, 22(1):106-114, January 1975.

Selected references

J. Bruno and K. Steiglitz. The expression of algorithms by charts. Journal of the ACM, 19(3):517-525, July 1972.

Shortcuts:

Journal of the ACM homepage

Bibliography top level

Journal of the ACM Author Index

Search the HBP database