Kern, Walter
Kern, Walter
Geverifieerd e-mailadres voor utwente.nl
Geciteerd door
Geciteerd door
The Shapley value for cooperative games under precedence constraints
U Faigle, W Kern
International Journal of Game Theory 21 (3), 249-266, 1992
On the performance of on-line algorithms for partition problems
U Faigle, W Kern, G Turán
Acta cybernetica 9 (2), 107-119, 1989
On the game chromatic number of some classes of graphs
U Faigle, W Kern, H Kierstead, WT Trotter
University of Twente, Faculty of Mathematical Sciences, 1991
Some convergence results for probabilistic tabu search
U Faigle, W Kern
ORSA Journal on Computing 4 (1), 32-37, 1992
Linear programming duality
A Bachem, W Kern
Linear Programming Duality, 216, 1992
Algorithmic principles of mathematical programming
U Faigle, W Kern, G Still
Springer Science & Business Media, 2013
An improved deterministic local search algorithm for 3-SAT
T Brueggemann, W Kern
Theoretical computer science 329 (1-3), 303-313, 2004
On the complexity of testing membership in the core of min-cost spanning tree games
U Faigle, W Kern, SP Fekete, W Hochstättler
International Journal of Game Theory 26 (3), 361-366, 1997
Matching games: the least core and the nucleolus
W Kern, D Paulusma
Mathematics of operations research 28 (2), 294-308, 2003
Dynamic programming for minimum Steiner trees
B Fuchs, W Kern, D Molle, S Richter, P Rossmanith, X Wang
Theory of Computing Systems 41 (3), 493-500, 2007
The generalized minimum spanning tree problem
PC Pop, W Kern, GJ Still
Faculty of Mathematical Sciences, University of Twente, 2000
On some approximately balanced combinatorial cooperative games
U Faigle, W Kern
Zeitschrift für Operations Research 38 (2), 141-152, 1993
On the computation of the nucleolus of a cooperative game
U Faigle, W Kern, J Kuipers
International Journal of Game Theory 30 (1), 79-98, 2001
Note: Computing the nucleolus of min-cost spanning tree games is NP-hard.
U Faigle, W Kern, J Kuipers
International Journal of Game Theory 27 (3), 1998
A robust PTAS for maximum weight independent sets in unit disk graphs
T Nieberg, J Hurink, W Kern
International workshop on graph-theoretic concepts in computer science, 214-221, 2004
On the core of ordered submodular cost games
U Faigle, W Kern
Mathematical Programming 87 (3), 483-499, 2000
On approximately fair cost allocation in Euclidean TSP games
U Faigle, SP Fekete, W Hochstättler, W Kern
Operations-Research-Spektrum 20 (1), 29-37, 1998
A Lagrangian relaxation approach to the edge-weighted clique problem
M Hunting, U Faigle, W Kern
European Journal of Operational Research 131 (1), 119-131, 2001
Approximation schemes for wireless networks
T Nieberg, J Hurink, W Kern
ACM Transactions on Algorithms (TALG) 4 (4), 1-17, 2008
A simple dual ascent algorithm for the multilevel facility location problem
A Bumb, W Kern
Approximation, randomization, and combinatorial optimization: Algorithms and …, 2001
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20