Applied result detail

Canadian Traveller Problem (CTP) design toolkit

ŠOUSTEK, P.; MATOUŠEK, R.

Original Title

Canadian Traveller Problem (CTP) design toolkit

English Title

Canadian Traveller Problem (CTP) design toolkit

Type

Software

Abstract

In computer science and graph theory, the Canadian Traveller Problem (CTP) is a generalization of the shortest path problem to graphs that are partially observable. In other words, the graph is revealed while it is being explored, and explorative edges are charged even if they do not contribute to the final path. CTPv1 is the toolkit for CTP software implementation.

Abstract in English

In computer science and graph theory, the Canadian Traveller Problem (CTP) is a generalization of the shortest path problem to graphs that are partially observable. In other words, the graph is revealed while it is being explored, and explorative edges are charged even if they do not contribute to the final path. CTPv1 is the toolkit for CTP software implementation.

Keywords

CTP, Canadian Traveller Problem, Optimization

Key words in English

CTP, Canadian Traveller Problem, Optimization

Location

http://www.uai.fme.vutbr.cz/~matousek/

Possibilities of use

only the provider uses the result

Licence fee

In order to use the result by another entity, it is always necessary to acquire a license

www

http://www.uai.fme.vutbr.cz/~matousek/