Narrow search
Showing 1 - 10 of 32
Cover Image
Computing the nucleolus of min-cost spanning tree games is NP-hard
Faigle, Ulrich; Kern, Walter; Kuipers, Jeroen - In: International journal of game theory : official journal … 27 (1998) 3, pp. 443-450
Persistent link: https://www.econbiz.de/10001437040
Cover Image
Some convergence results for probabilistic tabu search
Faigle, Ulrich; Kern, Walter - 1990
Persistent link: https://www.econbiz.de/10000803234
Cover Image
Note on the convergence of simulated annealing algorithms
Faigle, Ulrich; Kern, Walter - 1988
Persistent link: https://www.econbiz.de/10000776041
Cover Image
A note on the communication complexity of totally unimodular matrices
Kern, Walter; Faigle, Ulrich - 1988
Persistent link: https://www.econbiz.de/10000776046
Cover Image
On the computation of the nucleolus of a cooperative game
Faigle, Ulrich; Kern, Walter; Kuipers, Jeroen - In: International journal of game theory : official journal … 30 (2001) 1, pp. 79-98
Persistent link: https://www.econbiz.de/10001614787
Cover Image
Two extensions of the Shapley value for cooperative games
Driessen, Theo S. H.; Paulusma, Daniel - In: Mathematical methods of operations research 53 (2001) 1, pp. 35-49
Persistent link: https://www.econbiz.de/10001572461
Cover Image
On ordered languages and the optimization of linear functions by greedy algorithms
Faigle, Ulrich - 1983
Persistent link: https://www.econbiz.de/10000012455
Cover Image
On the rate of convergence of some stochastic processes
Kern, Walter - 1986
Persistent link: https://www.econbiz.de/10000730729
Cover Image
Scheduling jobs on parallel machines, each with a unit-capacity buffer
Baas, S. M.; Kern, Walter; Nawijn, W. M. - 1990
Persistent link: https://www.econbiz.de/10000803227
Cover Image
Minimum loss scheduling
Nawijn, W. M.; Kern, Walter; Baas, S. M. - 1990
Persistent link: https://www.econbiz.de/10000803228