Author:
Hwang Hark-Chin,Chang Soo Y.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference13 articles.
1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy ?Proof verification and hardness of approximation problems,?in Proceedings of the 33rd IEEE Symposium on the Foundations of Computer Science, 1992, pp 14?23.
2. S.Y. Chang, M.R. Chang, and Y.S. Hong ?A lot grouping algorithm for a continuous slab caster in an integrated steel mill,?Production Planning & Control, vol. 11, pp. 363?368, 2000.
3. Y. Crama and A.G. Oerlemans ?A column generation approach to job grouping for flexible manufacturing systems,?European Journal of Operational Research, vol. 78, pp. 58?80, 1994.
4. M.R. Garey and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman: San Francisco, CA, 1979.
5. V. Kann?Maximum bounded 3-dimensional matching is MAX SNP-complete,?Information Processing Letters, vol. 38, pp. 27?35, 1991.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献