Reference53 articles.
1. G. Ausiello, A. D’atri (1977) On the structure of combinatorial problems and structure preserving reductions. In: A. Salomaa, M. Steinby (eds.) (1977) Automata, Languages and Programming, Lecture Notes in Computer Science 52, Springer, Berlin, 45–60.
2. N. Christofides (1977) Worst-case analysis of a new heuristic for the travelling salesman problem. Management Sciences Research Report 388, Carnegie-Mellon University.
3. E.G. Coffman, Jr., M.R. Garey, D.S. Johnson (1977) An application of bin packing to multiprocessor scheduling. SIAM J. Comput. 7, 1–17.
4. S.A. Cook (1971) The complexity of theorem-proving procedures. Proc. 3rd Annual ACM Symp. Theory of Computing, 151–158.
5. G. Cornuejols, M.L. Fisher, G.L. Nemhauser (1977) Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Management Sci. 23, 789–810.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Developments in Multiprocessor Scheduling;Computer-Aided Civil and Infrastructure Engineering;1991-01
2. Stochastic scheduling problems II-set strategies-;Zeitschrift für Operations Research;1985-06
3. Introduction to Stochastic Scheduling Problems;Lecture Notes in Economics and Mathematical Systems;1985