PERT scheduling with convex cost functions

Author： Chretienne P.   Sourd F.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.292, Iss.1, 2003-01, pp. : 145-164

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Time-cost trade-off via optimal control theory in Markov PERT networks

By Azaron Amir  

Annals of Operations Research, Vol. 150, Iss. 1, 2007-03 ,pp. : 47-64

Springer Publishing Company

Access to resources Recommend Favorite

Well-positioned Closed Convex Sets and Well-positioned Closed Convex Functions

By Adly Samir   Ernst Emil   Théra Michel  

Journal of Global Optimization, Vol. 29, Iss. 4, 2004-08 ,pp. : 337-351

Springer Publishing Company

Access to resources Recommend Favorite

Beyond Convex? Global Optimization is Feasible Only for Convex Objective Functions: A Theorem

By Kreinovich Vladik   Kearfott R.  

Journal of Global Optimization, Vol. 33, Iss. 4, 2005-12 ,pp. : 617-624

Springer Publishing Company

Access to resources Recommend Favorite

The directional subdifferential of the difference of two convex functions

By Penot Jean-Paul  

Journal of Global Optimization, Vol. 49, Iss. 3, 2011-03 ,pp. : 505-519

Springer Publishing Company

Access to resources Recommend Favorite

Refined optimality conditions for differences of convex functions

By Valkonen Tuomo  

Journal of Global Optimization, Vol. 48, Iss. 2, 2010-10 ,pp. : 311-321

Springer Publishing Company

Access to resources Recommend Favorite