Search for $C$-optimal routes in graphs

We propose search algorithms for paths in graphs that are optimal in the sense of a given choice function. As an example we consider the choice mechanism with respect to a binary relation that does not contain numerical criterial estimates.