Article ID: | iaor19991994 |
Country: | Netherlands |
Volume: | 101 |
Issue: | 1 |
Start Page Number: | 104 |
End Page Number: | 121 |
Publication Date: | Aug 1997 |
Journal: | European Journal of Operational Research |
Authors: | Djerdjour Mohamed |
Keywords: | programming: network, programming: branch and bound |
This paper represents a framework for a branch and search algorithm for solving a class of general integer restricted, linearly constrained, quadratic integer programming problems where the objective function is a nonseparable quadratic concave function.