Author： Damaschke P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 845-852
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
On competitive on-line paging with lookahead
By Breslauer D.
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
Access to resources
Recommend
On-line Scheduling for Jobs with Arbitrary Release Times
By Li R. Huang H.-C.
Computing, Vol. 73, Iss. 1, 2004-07 ,pp. :
A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem
Annals of Operations Research, Vol. 81, Iss. 1, 1998-01 ,pp. :
Nonlinear resolving functions for the travelling salesman problem
By Sergeev S.
Automation and Remote Control, Vol. 74, Iss. 6, 2013-06 ,pp. :