Zoekresultaten
Resultaat 1 - 17 (van 17)
U. Faigle | W. Kern | G. Still Algorithmic principles of mathematical programming
Non-fictie
Engels | 337 pagina's | Kluwer Academic Publishers, Dordrecht [etc.] | 2002
Gedrukt boek
U. Faigle | W. Kern | W.M. Nawijn A greedy on-line algorithm for the k-track assignment problem
Non-fictie
Engels | 14 pagina's | University of Twente, Enschede | 1997
Gedrukt boek
U. Faigle | W. Kern Packing a bin online to maximize the total number of items
Non-fictie
Engels | 6 pagina's | University of Twente, Enschede | 1996
Gedrukt boek
U. Faigle | W. Kern Note on the convergence of simulated annealing algorithms
Non-fictie
Engels | University of Twente, Enschede | 1989
Gedrukt boek
U. Faigle | W. Kern | G. Turán On the performance of on-line algorithms for partition problems
Non-fictie
Engels | University of Twente, Enschede | 1989
Gedrukt boek
U. Faigle | W. Kern | Jeroen Kuipers An efficient algorithm for nucleolus and prekernel computation in some classes of TU-games
Non-fictie
Engels | 20 pagina's | University of Twente, Enschede | 1998
Gedrukt boek
U. Faigle | W. Kern The nucleon of cooperative games and an algorithm for matching games
Non-fictie
Engels | 16 pagina's | University of Twente, Enschede | 1995
Gedrukt boek
U. Faigle | Noud Gademann | W. Kern A random polynomial time algorithm for well-rounding convex bodies
Non-fictie
Engels | Faculty of Applied Mathematics, University of Twente, Enschede | 1992
Gedrukt boek
A.F. Bumb | W. Kern A simple dual ascent algorithm for the multilevel facility location problem
Non-fictie
Engels | 8 pagina's | University of Twente, Enschede | 2001
Gedrukt boek
P.C. Pop | W. Kern | G. Still An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size
Non-fictie
Engels | 9 pagina's | University of Twente, Enschede | 2001
Gedrukt boek
P.C. Pop | W. Kern | G. Still The generalized minimum spanning tree problem
Non-fictie
Engels | 10 pagina's | University of Twente, Enschede | 2000
Gedrukt boek
U. Faigle | W. Kern An algebraic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
Non-fictie
Engels | 23 pagina's | University of Twente, Enschede | 1998
Gedrukt boek
U. Faigle | W. Kern An intersection theorem for submodular linear programs on forests
Non-fictie
Engels | 7 pagina's | University of Twente, Enschede | 1994
Gedrukt boek
U. Faigle | Renate Garbe | W. Kern Randomized online algorithms for maximizing busy time interval scheduling
Non-fictie
Engels | 9 pagina's | University of Twente, Enschede | 1994
Gedrukt boek
U. Faigle | W. Kern A characterization of non-negative greedy matrices
Non-fictie
Engels | University of Twente, Enschede | 1993
Gedrukt boek
U. Faigle | W. Kern Submodular linear programs on forests
Non-fictie
Engels | Faculty of Applied Mathematics, University of Twente, Enschede | 1993
Gedrukt boek
U. Faigle | W. Kern The shapley value for cooperative games under precedence constraints
Non-fictie
Engels | Faculty of Applied Mathematics, University of Twente, Enschede | 1992
Gedrukt boek