Author： Nuggehalli R.
Publisher： Springer Publishing Company
E-ISSN： 1572-9338|110|1-4|17-31
ISSN： 0254-5330
Source： Annals of Operations Research, Vol.110, Iss.1-4, 2002-02, pp. : 17-31
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Access to resources
Recommend
A new lower bound for the open-shop problem
Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. :
Improved Lower Bounds for the Quadratic Assignment Problem
Automation and Remote Control, Vol. 65, Iss. 11, 2004-11 ,pp. :
A new lower bound for the list update problem in the partial cost model
By Ambuhl C. Gartner B. von Stengel
Theoretical Computer Science, Vol. 268, Iss. 1, 2001-10 ,pp. :