A New Global Optimization Algorithm Using D. C. Underestimator and Convex Cut Function for General NLP Problem

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 392
  • Download : 0
Issue Date
2003
Language
KOR
Citation

화학공학회, pp.26 - 26

URI
http://hdl.handle.net/10203/147662
Appears in Collection
CBE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0