Kern Walter

Walter Kern

Information about the author Walter Kern will soon be added to the site.
Found 10 papers in total
Computing solutions for matching games
Computing solutions for matching games
2012
A matching game is a cooperative game ( N , v ) defined on a graph G = ( N , E ) with...
Quality of move-optimal schedules for minimizing total weighted completion time
Quality of move-optimal schedules for minimizing total weighted completion time
2006
We study the minimum total weighted completion time problem on identical machines. We...
The computational complexity of the elimination problem in generalized sports competitions
The computational complexity of the elimination problem in generalized sports competitions
2004
Consider a sports competition among various teams playing against each other in pairs...
Matching games: The least core and the nucleolus
Matching games: The least core and the nucleolus
2003
A matching game is a cooperative game defined by a graph G = (N, E). The player set is...
A Lagrangian relaxation approach to the edge-weighted clique problem
A Lagrangian relaxation approach to the edge-weighted clique problem
2001
The b -clique polytope CP n b is the convex hull of the node and edge incidence...
The nucleon of cooperative games and an algorithm for matching games
The nucleon of cooperative games and an algorithm for matching games
1998
The nucleon is introduced as a new allocation concept for non-negative cooperative n...
Submodular linear programs on forests
Submodular linear programs on forests
1996
A general linear programming model for an order-theoretic analysis of both...
Computational complexity of some maximum average weight problems with precedence constraints
Computational complexity of some maximum average weight problems with precedence constraints
1994
Maximum average weight ideal problems in ordered sets arise from modeling variants of...
A probabilistic analysis of the switching algorithm for the Euclidean TSP
A probabilistic analysis of the switching algorithm for the Euclidean TSP
1989
The well-known switching algorithm proposed by Lin and Kernighan for the Euclidean...
On the rate of convergence of some stochastic processes
On the rate of convergence of some stochastic processes
1989
The paper presents a general technique for obtaining bounds on the deviation of the...
Papers per page: