A finite concave minimization algorithm using branch and bound and neighbor generation
Year of publication: |
1994
|
---|---|
Authors: | Benson, Harold P. |
Other Persons: | Sayın, Serpil (contributor) |
Published in: |
Journal of global optimization. - Dordrecht [u.a.] : Springer, ISSN 0925-5001, ZDB-ID 1074566-X. - Vol. 5.1994, 1, p. 1-14
|
Subject: | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Optimal proactive monitor placement & scheduling for IoT networks
Mostafa, Basma, (2022)
-
Eirinakis, Pavlos, (2024)
-
A hybrid ANN-MILP model for agile recovery production planning for PPE products under sharp demands
Babazadeh, Reza, (2025)
- More ...
-
Exploring the trade-off between generalization and empirical errors in a one-norm SVM
Aytug, Haldun, (2012)
-
Kirlik, Gokhan, (2014)
-
Karabatı, Selçuk, (2008)
- More ...