Showing 1 - 5 of 5
Shortest path problems occupy an important position in Operations Research as well as in Arti¯cial Intelligence. In this paper we study shortest path algorithms that exploit heuristic estimates. The well-known algorithms are put into one framework. Besides we present an interesting application...
Persistent link: https://www.econbiz.de/10010731678
The notion of transit function is introduced to present a unifying approach for results and ideas on intervals, convexities and betweenness in graphs and posets. Prime examples of such transit functions are the interval function I and the induced path function J of a connected graph. Another...
Persistent link: https://www.econbiz.de/10010731801
The median problem is a classical problem in Location Theory: one searches for a location that minimizes the average distance to the sites of the clients. This is for desired facilities as a distribution center for a set of warehouses. More recently, for obnoxious facilities, the antimedian was...
Persistent link: https://www.econbiz.de/10010734036
A widely known algorithm for ¯nding the shortest path in a network is Bidirectional A*. The version of bidirectional A …
Persistent link: https://www.econbiz.de/10010837827
consistent prediction errors, and it helps to prevent data snooping. Tools are introduced to evaluate the algorithm, to see how … configurations are updated by the algorithm, to study how forecasting accuracy is affected by the choice of configurations, and to … find out which configurations can safely be ignored in order to increase the speed of the algorithm. In our case study we …
Persistent link: https://www.econbiz.de/10011149275