A Novel Global Optimization Algorithm with Difference of Convex Underestimator for Linearly Constrained Problems

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 351
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorLee, Tai-Yong-
dc.date.accessioned2013-03-16T21:09:38Z-
dc.date.available2013-03-16T21:09:38Z-
dc.date.created2012-02-06-
dc.date.issued2002-
dc.identifier.citationSymposium on Chemical Engineering Daejeon/Chungnam-Kyushu, v., no., pp. --
dc.identifier.urihttp://hdl.handle.net/10203/135895-
dc.languageENG-
dc.titleA Novel Global Optimization Algorithm with Difference of Convex Underestimator for Linearly Constrained Problems-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.publicationnameSymposium on Chemical Engineering Daejeon/Chungnam-Kyushu-
dc.identifier.conferencecountryJapan-
dc.contributor.localauthorLee, Tai-Yong-
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