Branch and Bound Experiments in Convex Nonlinear Integer Programming
Year of publication: |
1985
|
---|---|
Authors: | Gupta, Omprakash K. ; Ravindran, A. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 31.1985, 12, p. 1533-1546
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | programming: integer algorithms | branch and bound | tests | programming: nonlinear | algorithm tests |
-
Covering Relaxation for Positive 0-1 Polynomial Programs
Granot, Daniel, (1979)
-
Heuristics for Multilevel Lot-Sizing with a Bottleneck
Billington, Peter J., (1986)
-
Bagga, P. C., (1980)
- More ...
-
Branch and bound experiments in convex nonlinear integer programming
Gupta, Omprakash K., (1985)
-
Gupta, Omprakash K., (2011)
-
Saha, Gour C., (2006)
- More ...