An enumerative algorithm framework for a class of nonlinear integer programming problems

European Journal of Operational Research

Volumn 101, Issue 1, 1997, Pages 104-121

  Djerdjour, Mohamed ^a  

^a LAURENTIAN UNIVERSITY   (Canada)

Author keywords

Dual surrogate problem; Eigenvalue; Enumeration tree; Mathematical programming; Nonlinear integer programming

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; EIGENVALUES AND EIGENFUNCTIONS; FUNCTION EVALUATION; INTEGER PROGRAMMING; TREES (MATHEMATICS);

OBJECTIVE FUNCTIONS;

NONLINEAR PROGRAMMING;

EID: 0031199152     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00164-6     Document Type: Article

References (23)

1. Adams, W.P. and Sherali, H.D., 1986. A tight linearization and algorithm for 0-1 quadratic programming problems. Management Science, 32(10), 1274-1290.
2. Balas, E., 1969. Duality in discrete programming: The quadratic case. Management Science, 16(1), 14-31.
3. Balas, B. and Mazzola, J.B., 1984. Nonlinear 0-1 programming: linearization techniques. Mathematical programming, 30, 1-21.
4. Djerdjour, M., Mathur, K. and Salkin, H., 1988. A Surrogate-based algorithm for the general quadratic multidimensional knapsack problem. Operations Research Letters, 7(5), 253-257.
5. Dyer, M.E., 1980. Calculating surrogate constraints. Mathematical programming, 19, 255-278.
6. Findley, M.C. and Messner, S.D., 1979. Optimal real estate portfolios. Journal of American Real Estate Urban Economical Association, 7, 288-317.
7. Fox, B. and Liebman, J., 1981. A discrete nonlinear simplex method for optimized engineering design. Engineering Optimization, 5, 129-149.
8. Glover, F., 1967. Surrogate constraints. Operations Research, 16(4), 741-749.
9. Glover, F. and Klingman, D., 1975. Surrogate constraint duality in mathematical programming. Operations Research, 23(3), 434-453.
10. Karwan, M.H and Rardin, R.L., 1984. Surrogate multipliers search procedures in integer programming. Operations Research, 32, 52-69.
11. Markowitz, H.M, 1959. Portfolio Selection: efficient diversification of investments, Wiley, New-york.
12. Martos, B., 1975. Nonlinear Programming: Theory and methods, Amsterdam.
13. Meyer, R.R., 1982. Recursive piecewise-linear approximation methods for nonlinear networks, Lectures in economics and mathematical systems, Springer, New-york.
14. Miller, B.L, 1971. On minimizing nonseparable functions on the integers with inventory applications. SIAM Journal on Applied Mathematics, 21, 166-185.
15. Minc, H. and Marcus, M., 1964. A survey of Matrix Theory and Matrix inequalities. Allyn and Bacon Inc., Boston.
16. Moder, J.J and Phillips, C.R., 1983. Project Management with CPM and PERT, Rheinhold, New-York.
17. Nakagawa, Y., 1978. Optimal reliability allocation by branch and bound techniques. IEEE Trans. On Reliability, 27(31), 27-35.
18. Nemhauser, G.L., 1993. The age of optimization: Solving large-scale real world problems. The philip McCord Morse Lecture, TIMS/ORSA conference, Chicago.
19. Oron, G., 1979. An algorithm for optimizing nonlinear constrained 0-1 problems to improve wastewater treatment. Engineering Optimization, 4, 109-115.
20. Ravindran, A. and Lee, H.K., 1981. Computer experiments on quadratic programming algorithms. European Journal of Operational Research, 8, 166-174.
21. Sherali, H.D. and Myers, D.C., 1986. The design of branch and bound algorithms for nonlinear integer programs. Annals of Operations Research, 5, 463-484.
22. Stecke, K., 1983. Nonlinear integer production planning problems. Management Science, 29(3), 273-288.
23. Vetterling, W.T., Teukolsky, S.A., Flannery, B.P. and Press, H.W., 1986. Numerical Recipes, Cambridge University Press, London.