Searching for authors named "Walter Kern" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

10 documents found, showing 1 through 10.

Paulusma: Matching games: The least core and the nucleolus
by W. Kern, D. Paulusma, Walter Kern, Daniël Paulusma — Math. of Operations Research
…@(email omitted); ISSN 0169-2690 MATCHING GAMES: THE LEAST CORE AND THE NUCLEOLUS WALTER KERN AND DANIËL PAULUSMA…
Cited by 1 (1 self) – Add To MetaCart

An algebraic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
by Ulrich Faigle, Walter Kern — 1998
… OF COOPERATIVE GAMES ULRICH FAIGLE AND WALTER KERN Abstract. An algebraic model generalizing submodular polytopes…
Cited by 1 (0 self) – Add To MetaCart

On The Core Of Ordered Submodular Cost Games
by Ulrich Faigle, Walter Kern — 1997
…ON THE CORE OF ORDERED SUBMODULAR COST GAMES ULRICH FAIGLE AND WALTER KERN Abstract. A general…
Cited by 11 (1 self) – Add To MetaCart

On The Computation Of The Nucleolus Of A Cooperative Game
by Ulrich Faigle, Walter Kern, Jeroen Kuipers — 1999
…ON THE COMPUTATION OF THE NUCLEOLUS OF A COOPERATIVE GAME ULRICH FAIGLE, WALTER KERN…
Cited by 3 (0 self) – Add To MetaCart

A Lagrangian Relaxation Approach to the Edge-Weighted Clique Problem
by Marcel Hunting, Ulrich Faigle, Walter Kern — 1999 — European Journal of Operational Research
… FAIGLE, AND WALTER KERN Abstract. The b-clique polytope CP n b is the convex hull of the node…
Cited by 7 (0 self) – Add To MetaCart

Note on the Computational Complexity of Least Core Concepts for Min-Cost Spanning Tree Games
by Ulrich Faigle, Walter Kern, Dani, Daniel Paulusma — 1999 — University of Twente
… FAIGLE, WALTER KERN, AND DANI EL PAULUSMA Abstract. Various least core concepts including the classical…
Cited by 1 (1 self) – Add To MetaCart

The nucleon of cooperative games and an algorithm for matching games
by Ulrich Faigle, Sandor P. Fekete, Winfried Hochstättler, Walter Kern — 1997 — Mathematical Programming
… revised 5/97 to appear: Mathematical Programming Ulrich Faigle Walter Kern Department of Applied…
Cited by 4 (3 self) – Add To MetaCart

Online Matching On a Line
by Bernhard Fuchs, Winfried Hochstättler, Zentrum Fur Angew, Te Informatik Koln, Walter Kern — 2003 — Electronic Notes in Discrete Mathematics
… Postfach 10 13 44, D-03013 Cottbus Walter Kern Department of Applied Mathematics University of Twente, P…
Cited by 5 (0 self) – Add To MetaCart

On The Complexity Of Testing Membership In The Core Of Min-Cost Spanning Tree Games
by U. Faigle, S. Fekete, W. Hochstattler, Walter Kern, Sandor P. Fekete, Winfried Hochstättler, Ulrich Faigle, Ulrich Faigle, Walter Kern, Walter Kern, Or P. Fekete Winfried Hochstattler — 1994 — International Journal of Game Theory
… Games by U. Faigle, S. Fekete, W. Hochstattler, W. Kern 1994 Ulrich Faigle Walter Kern Department…
Cited by 20 (7 self) – Add To MetaCart

On approximately fair cost allocation in Euclidean TSP games
by U. Faigle, S. Fekete, W. Hochstattler, Walter Kern, Sandor P. Fekete, Winfried Hochstättler, Ulrich Faigle, Ulrich Faigle, Or P. Fekete, Winfried Hochst Attler, Walter Kern, Walter Kern — 1996
… to appear in: Spektrum of OR Ulrich Faigle Walter Kern Department of Applied Mathematics University…
Cited by 5 (1 self) – Add To MetaCart

Showing 1 through 10.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB