Worst-case analysis of the subset sum algorithm for bin packing

Publisher： Elsevier

ISSN： 0167-6377

Source： Operations Research Letters, Vol.32, Iss.2, 2004-03, pp. : 159-166

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

Related content

Worst-case analysis of generalized heapsort algorithm revisited

By Islam Tarique

International Journal of Computer Mathematics, Vol. 83, Iss. 1, 2006-01 ,pp. : 59-67

Taylor & Francis Ltd

Access to resources Recommend Favorite

Worst-case analysis for on-line service policies

By Wang Zhenbo Xing Wenxun

Journal of Combinatorial Optimization, Vol. 19, Iss. 1, 2010-01 ,pp. : 107-122

Springer Publishing Company

Access to resources Recommend Favorite

Efficient worst‐case analysis of electronic networks in intervals of frequency

INTERNATIONAL JOURNAL OF NUMERICAL MODELLING: ELECTRONIC NETWORKS, DEVICES AND FIELDS, Vol. 31, Iss. 2, 2018-03 ,pp. : n/a-n/a

John Wiley & Sons Inc

Access to resources Recommend Favorite

Average-Case Performance Analysis of a 2D Strip Packing Algorithm—NFDH

By Gu Xiaodong Chen Guoliang Xu Yinlong

Journal of Combinatorial Optimization, Vol. 9, Iss. 1, 2005-02 ,pp. : 19-34

Springer Publishing Company

Access to resources Recommend Favorite

The Worst-Case GMRES for Normal Matrices

By Liesen Jörg

Bit Numerical Mathematics, Vol. 44, Iss. 1, 2004-01 ,pp. : 79-98

Springer Publishing Company

Access to resources Recommend Favorite