On some nonlinear knapsack problems

Annals of Discrete Mathematics

Volumn 1, Issue C, 1977, Pages 403-414

  Michaeli, I ^a   Pollatschek, M A ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0008041653     PISSN: 01675060     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0167-5060(08)70748-9     Document Type: Article

References (10)

1. Balas, E., Duality in discrete programming II. The quadratic case. Management Sci. 16 (1969), 14–32.
2. R.E. Burkard, A method for mixed-integer convex programming, in Proc. Fourth Conf. on Probability Theory (Editura Academiei Republicii Socialiste Romania, 1973).
3. Geoffrion, A.M., Marsten, R.E., Integer-programming algorithms. Management Sci. 18 (1972), 465–491.
4. Gomory, R.E., On the relation between integer and non-integer solutions to linear programs. Proc. Nat. Sci., USA 53 (1965), 260–265.
5. Hammer, P.L., Boolean procedures for bivalent programming. Hammer, P.L., Zouten-dijk, G., (eds.) Mathematical Programming in Theory and Applications, 1974, North-Holland, Amsterdam.
6. Korte, B., Krelle, W., Oberhofer, W., Ein Lexicographischer Suchalgorithmus zur Losung allgemeiner ganzzaliger Programmirungsaufgaben. Unternehmensforschung 13 (1969), 73–98 171–192.
7. Kunzi, H.P., Oettli, W., Integer quadratic programming. Groves, R.L., Wolf, P., (eds.) Recent Advances in Mathematical Programming, 1963, McGraw Hill, New York.
8. Miller, B.L., On minimizing non-separable functions defined on integers with an inventory application. SIAM J. Appl. Math. 21 (1971), 166–185.
9. Washburn, A., A note on integer maximization of unimodal functions. Operations Res. 23 (1975), 358–360.
10. Witzgall, C., An all-integer programming algorithm with parabolic constraints. J. SIAM. 11 (1963), 855–871.