z-logo
open-access-imgOpen Access
On the effect of precedence constraints on computational complexity of dynamic programming method for routing problems
Author(s) -
Ya.V. Salii
Publication year - 2014
Publication title -
vestnik udmurtskogo universiteta matematika mekhanika komp yuternye nauki
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.354
H-Index - 8
eISSN - 2076-5959
pISSN - 1994-9197
DOI - 10.20537/vm140107
Subject(s) - computer science , dynamic programming , routing (electronic design automation) , mathematical optimization , computational complexity theory , algorithm , mathematics , computer network

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom