Search Results - subject:"Graph theory"

Business process verification : a Petri Net approach

De Backer, Manu (contributor); Snoeck, Monique (contributor) - 2007

Persistent link: https://www.econbiz.de/10003621830

Evaluierung und Auswahl von strategischen Liefernetzen unter Berücksichtigung kritischer Knoten

Müssigmann, Nikolaus (contributor) - 2007

Persistent link: https://www.econbiz.de/10003476590

Strongly regular graphs with maximal energy

Haemers, Willem H. (contributor) - 2007

Persistent link: https://www.econbiz.de/10003656721

Applications of Relations and Graphs to Coalition Formation

Rusinowska, Agnieszka; Berghammer, Rudolf; de Swart, Harrie - 2006

, graph theory, social choice and bargaining theory, and by using the computer support system RelView for computing solutions …

Persistent link: https://www.econbiz.de/10010312352

Bidirectional A*: comparing balanced and symmetric heuristic methods

Post, H.; Pijls, W.H.L.M. - Erasmus University Rotterdam, Econometric Institute - 2006

* Search Meets Graph Theory, In: 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’05) 2005. [3] Ikeda T.K., M …* framework. The symmetric instance surpasses the balanced instance in space and time. Keywords: Shortest path, Network ow, Graph … theory, Operations Research, Search. ⁄This research is part of a Ph.D. project of the second author at Delft University of …

Persistent link: https://www.econbiz.de/10005450866

Heuristic estimates in shortest path algorithms

Pijls, Pijls, W.H.L.M. - Faculteit der Economische Wetenschappen, Erasmus … - 2006

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

Bidirectional A*: comparing balanced and symmetric heuristic methods

Post, Post, H.; Pijls, Pijls, W.H.L.M. - Faculteit der Economische Wetenschappen, Erasmus … - 2006

A widely known algorithm for ¯nding the shortest path in a network is Bidirectional A*. The version of bidirectional A* that is considered the most appropriate hitherto, uses so-called balanced heuristic estimates. In this paper, we focus on symmetric heuristic estimates. First, we show that...

Persistent link: https://www.econbiz.de/10010837827

Heuristic estimates in shortest path algorithms

Pijls, W.H.L.M. - Erasmus University Rotterdam, Econometric Institute - 2006

* Search Meets Graph Theory, in: 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’05), extended version in …. Besides we present an interesting application of binary numbers in the shortest path theory. Keywords: Network ows, Graph … theory, Operations Research, Search problems. ⁄Econometric Institute, Erasmus University Rotterdam, P.O.Box 1738, 3000 DR …

Persistent link: https://www.econbiz.de/10004991088

Applications of Relations and Graphs to Coalition Formation

Rusinowska, Agnieszka; Berghammer, Rudolf; Swart, Harrie de - Fondazione ENI Enrico Mattei (FEEM) - 2006

, graph theory, social choice and bargaining theory, and by using the computer support system RelView for computing solutions …

Persistent link: https://www.econbiz.de/10005230883

Applications of Relations and Graphs to Coalition Formation

Rusinowska, Agnieszka; Berghammer, Rudolf; De Swart, Harrie - 2006

, graph theory, social choice and bargaining theory, and by using the computer support system RelView for computing solutions …

Persistent link: https://www.econbiz.de/10014058104