Author： Luz C.J. Cardoso D.M.
Publisher： Elsevier
ISSN： 0377-2217
Source： European Journal of Operational Research, Vol.132, Iss.3, 2001-08, pp. : 569-581
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A new upper bound for the 0-1 quadratic knapsack problem
By Billionnet A. Faye A. Soutif E.
European Journal of Operational Research, Vol. 112, Iss. 3, 1999-02 ,pp. :
Access to resources
Recommend
Reexploring the upper bound for the chromatic number of graphs*
Progress in Natural Science, Vol. 14, Iss. 3, 2004-03 ,pp. :
On weighted centers for semidefinite programming
European Journal of Operational Research, Vol. 126, Iss. 2, 2000-10 ,pp. :