Detail aplikovaného výsledku

Canadian Traveller Problem (CTP) design toolkit

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

Originální název

Canadian Traveller Problem (CTP) design toolkit

Anglický název

Canadian Traveller Problem (CTP) design toolkit

Druh

Software

Abstrakt

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.

Abstrakt anglicky

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.

Klíčová slova

CTP, Canadian Traveller Problem, Optimization

Klíčová slova anglicky

CTP, Canadian Traveller Problem, Optimization

Umístění

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

Možnosti využití

výsledek využívá pouze poskytovatel

Licenční poplatek

K využití výsledku jiným subjektem je vždy nutné nabytí licence

www

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