Author： Schichl Hermann Neumaier Arnold
Publisher： Springer Publishing Company
ISSN： 0925-5001
Source： Journal of Global Optimization, Vol.33, Iss.4, 2005-12, pp. : 541-562
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
Shortest path algorithms for nearly acyclic directed graphs
By Takaoka T.
Theoretical Computer Science, Vol. 203, Iss. 1, 1998-08 ,pp. :
Access to resources
Recommend
A fast memoryless interval-based algorithm for global optimization
By Sun M.
Journal of Global Optimization, Vol. 47, Iss. 2, 2010-06 ,pp. :
Efficient algorithms for acyclic colorings of graphs
By Chen Z.-Z.
Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. :