1 |
Won, J. Y. and Chung, S. J. (1991), The multi-divisional linear knapsack problem, Journal of the Korean Institute of Industrial Engineers, 17(1), 127-130.
과학기술학회마을
|
2 |
Dudzinski, K. (1989), On a cardinality constrained linear programming knapsack problem, Operations Research letters, 8, 215-218.
DOI
ScienceOn
|
3 |
Sim, S. B., Jang, J. H., Jung, H. S., and Jeong, B. J. (2013), Military logistics consolidation center location problem : modeling and analysis, Journal of the Korean Institute of Industrial Engineers, 39(6), 587-598.
DOI
ScienceOn
|
4 |
Suh, J. D. (2012), A multistage metaheuristic scheduling algorithm in LCD module lines composed of processes, Journal of the Korean Institute of Industrial Engineers, 38(4), 262-275.
과학기술학회마을
DOI
ScienceOn
|
5 |
Won, J. Y. (2011), On a two dimensional linear programming knapsack problem with the generalized GUB constraint, Journal of the Korean Institute of Industrial Engineers, 37(3), 258-263.
과학기술학회마을
DOI
ScienceOn
|
6 |
Armstrong, R. D., Sinha P., and Zoltners, A. A. (1982), The multiplechoice nested knapsack model, Management Science, 28(1), 34-43.
DOI
ScienceOn
|
7 |
Balas, E. and Zemel, E. (1980), An algorithm for large zero-one knapsack problem, Operations Research, 28(5), 1130-1154.
DOI
ScienceOn
|
8 |
Campello, R. E. and Maculan, N. F. (1987), Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints : properties and algorithms, Discrete Applied Mathematics, 18, 119-136.
DOI
ScienceOn
|