Narrow search
Showing 1 - 10 of 398
Cover Image
On the complexity of Convex Hull Algorithms if rotational minima can be found very fast
Huckenbeck, Ulrich - In: Zeitschrift für Operations-Research : ZOR ; … 32 (1988) 3/4, pp. 187-199
Persistent link: https://www.econbiz.de/10003582939
Cover Image
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs
Zhou, Yi; Rossi, André; Hao, Jin-Kao - In: European journal of operational research : EJOR 269 (2018) 3, pp. 834-843
Persistent link: https://www.econbiz.de/10011866668
Cover Image
Mathematical models and routing algorithms for economical cutting tool paths
Makarovskikh, T. A.; Panyukov, A. V.; Savitskiy, E. A. - In: International journal of production research 56 (2018) 3, pp. 1171-1188
Persistent link: https://www.econbiz.de/10011870694
Cover Image
Empirical perspectives on learning at work
Meyer, Jan - 2012
Persistent link: https://www.econbiz.de/10009768211
Cover Image
Machine learning as a tool for hypothesis generation
Ludwig, Jens; Mullainathan, Sendhil - In: The quarterly journal of economics 139 (2024) 2, pp. 751-827
Persistent link: https://www.econbiz.de/10014528137
Cover Image
An optimal algorithm for finding a minimum clique covering of a circular-arc graph
Asano, Takao - 1989
Persistent link: https://www.econbiz.de/10000781122
Cover Image
A faster algorithm for finding a maximum weight clique of a circular-arc graph
Asano, Takao - 1990
Persistent link: https://www.econbiz.de/10000785957
Cover Image
Optimal parallel algorithms for cicular-arc graphs
Asano, Takao - 1990
Persistent link: https://www.econbiz.de/10000789273
Cover Image
Recognition and optimization algorithms for co-triangulated graphs
Hoàng, Chinh T. - 1990
Persistent link: https://www.econbiz.de/10000795060
Cover Image
A parallel algorithm for minimum weighted colouring of triangulated graphs
Hoàng, Chinh T. - 1990
Persistent link: https://www.econbiz.de/10000801218