Global optimization of nonconvex MINLP by a hybrid Branch-and-bound and revised general Benders decomposition method
Author(s)
Bibliographic Information
Global optimization of nonconvex MINLP by a hybrid Branch-and-bound and revised general Benders decomposition method
（ISE-TR, 02-186）
Institute of Information Sciences and Electronics, University of Tsukuba, 2002
Available at / 1 libraries
-
No Libraries matched.
- Remove all filters.
Search this Book/Journal
Note
Includes bibliographical references
