Show simple item record

dc.contributor.authorChomątek, Łukasz
dc.date.accessioned2015-06-03T11:16:01Z
dc.date.available2015-06-03T11:16:01Z
dc.date.issued2013
dc.identifier.citationJournal of Applied Computer Science., 2013 Vol.21 nr 1 s.25-38
dc.identifier.issn1507-0360
dc.identifier.other0000040292
dc.identifier.urihttp://hdl.handle.net/11652/466
dc.description.abstractThe problem of route optimization is significant due to the fact of the high availablity of private transport as well as the need of efficient utilization of the corporate fleet. Optimal route can have different meaning for different users. In the existing algorithms designed for finding optimal route between two points on the map, hardly any preferences are reflected. In this article we present efficient algorithm for finding optimal route between points on the map which is designed to conforms Users’ needs.en_EN
dc.formatapplication/pdf
dc.language.isoen
dc.publisherWydawnictwo Politechniki Łódzkiejpl_PL
dc.publisherLodz University of Technology. Pressen_EN
dc.relation.ispartofseriesJournal of Applied Computer Science., 2013 Vol.21 nr 1en_EN
dc.titleParallel hierarchies for solving Single Source Shortest Path problem
dc.typeArtykuł


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record