On the Hardness of the Maximum Lot Grouping Problem |
Hwang, Hark-Chin (Department of Industrial Engineering, Chosun University) |
1 | Garey M.R., Johnson D.S. (1979), Computers and Intractability: A Guide to the theory of NP-Completeness, San Francisco, CA: Freeman. |
2 | Micali S., Vazirani V.V. (1980), An Algorithm for Finding Maximum Matching in General Graphs, Proc. Twentyfirst Annual Symposium on the Foundations of Computer Science 17-27. |
3 | Papadimitriou, C.H., Steiglitz K. (1988), Combinatorial Optimization, Mineola, NY:DOVER PUBLICATIONS, INC. |