Narrow search
Showing 1 - 10 of 27
Cover Image
How to find frequent patterns?
Pijls, Wim (contributor); Kosters, Walter A. (contributor) - 2005
Persistent link: https://www.econbiz.de/10003010833
Cover Image
The minimum spanning tree and duality in graphs
Pijls, Wim - 2013
Persistent link: https://www.econbiz.de/10009755008
Cover Image
Heuristic estimates in shortest path algorithms
Pijls, Wim (contributor) - 2006
Persistent link: https://www.econbiz.de/10003385240
Cover Image
Game tree algorithms and solution trees
Pijls, Wim; Bruin, Arie de - 1998
Persistent link: https://www.econbiz.de/10000986088
Cover Image
A general framework for shortest path algorithms
Pijls, Wim; Kolen, Antoon W. J. - 1992
Persistent link: https://www.econbiz.de/10000843067
Cover Image
Note on "A new bidirectional algorithm for shortest paths"
Pijls, Wim; Post, Henk - In: European journal of operational research : EJOR 207 (2010) 2, pp. 1140-1141
Persistent link: https://www.econbiz.de/10008652571
Cover Image
Dilworth's theorem revisited, an algorithmic proof
Pijls, Wim; Potharst, Rob - 2011
Persistent link: https://www.econbiz.de/10009619370
Cover Image
Repairing non-monotone ordinal data sets by changing class labels
Pijls, Wim; Potharst, Rob - 2015
Persistent link: https://www.econbiz.de/10010507689
Cover Image
Bidirectional A*: comparing balanced and symmetric heuristic methods
Pijls, Wim (contributor); Post, Henk (contributor) - 2006
Persistent link: https://www.econbiz.de/10003385241
Cover Image
Yet another bidirectional algorithm for shortest paths
Pijls, Wim; Post, Henk - 2009
Persistent link: https://www.econbiz.de/10003877075