1 |
Campello, R.E. and Maculan, N.F., Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints : properties and algorithms. Discrete Applied Mathematics, 1987, Vol. 18, No. 2, pp. 119-136.
DOI
|
2 |
Dudzinski, K. and Walukiewicz, S., On the multiperiod binary knapsack problem. Bulletin of the Polish Academy of Sciences Technical Sciences, 1985, Vol. 33, pp. 85-91.
|
3 |
Dudzinski, K., On a cardinality constrained linear programming knapsack problem. Operations Research letters, 1989, Vol. 8, No. 4, pp. 215-218.
DOI
|
4 |
Faaland, B.H., The multiperiod knapsack problem. Operations Research, 1981, Vol. 29, pp. 612-616.
DOI
|
5 |
Lin, E. and Wu, C., The multiple-choice multi-period knapsack problem. Journal of the Operational Research Society, 2004, Vol. 55, pp. 187-197.
DOI
|
6 |
Won, J.Y., On a two dimensional linear programming knapsack problem with the extended GUB constraint. Journal of the Korean Institute of Industrial Engineers, 2001, Vol. 27, No. 1, pp. 25-29.
|
7 |
Won, J.Y., The generalized continuous multiple-choice linear knapsack problem with generalized lower bound constraints. Journal of Society of Korea Industrial and Systems Engineering, 1998, Vol. 21, No. 45, pp. 291-299.
|