The Mean-Partition Problem

Author： Chang Fei-Hwang   Hwang Frank   Rothblum Uriel  

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.36, Iss.1, 2006-09, pp. : 21-31

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

Supermodularity in Mean-Partition Problems*

By Chang F.   Hwang F.  

Journal of Global Optimization, Vol. 33, Iss. 3, 2005-11 ,pp. : 337-347

Springer Publishing Company

Access to resources Recommend Favorite

An Optimal Partition Problem for Eigenvalues

By Cafferelli L.   Lin Fang  

Journal of Scientific Computing, Vol. 31, Iss. 1-2, 2007-05 ,pp. : 5-18

Springer Publishing Company

Access to resources Recommend Favorite

Efficient algorithms for a mixed k-partition problem of graphs without specifying bases

By Wada K.   Takaki A.   Kawaguchi K.  

Theoretical Computer Science, Vol. 201, Iss. 1, 1998-07 ,pp. : 233-248

Elsevier

Access to resources Recommend Favorite

An efficient tabu search algorithm for the single- machine mean tardiness problem

By Ben-Daya M.   Al-Fawzan M.  

Production Planning and Control, Vol. 8, Iss. 7, 1997-10 ,pp. : 694-700

Taylor & Francis Ltd

Access to resources Recommend Favorite

An integrated inventory–targeting problem with time-dependent process mean

By Al-Fawzan M. A.   Hariga M.  

Production Planning and Control, Vol. 13, Iss. 1, 2002-01 ,pp. : 11-16

Taylor & Francis Ltd

Access to resources Recommend Favorite