AAAAAA

   
Results: 1-15 |
Results: 15
COOPERATIVE GAME-THEORY AND APPLICATIONS - CURIEL,I
Authors: FAIGLE U
Citation: U. Faigle, COOPERATIVE GAME-THEORY AND APPLICATIONS - CURIEL,I, Journal of economics (Wien), 67(3), 1998, pp. 344-346
APPROXIMATE CORE ALLOCATION FOR BINPACKING GAMES
Authors: FAIGLE U KERN W
Citation: U. Faigle et W. Kern, APPROXIMATE CORE ALLOCATION FOR BINPACKING GAMES, SIAM journal on discrete mathematics (Print), 11(3), 1998, pp. 387-399
THE NUCLEON OF COOPERATIVE GAMES AND AN ALGORITHM FOR MATCHING GAMES
Authors: FAIGLE U KERN W FEKETE SP HOCHSTATTLER W
Citation: U. Faigle et al., THE NUCLEON OF COOPERATIVE GAMES AND AN ALGORITHM FOR MATCHING GAMES, Mathematical programming, 83(2), 1998, pp. 195-211
COMPUTING THE NUCLEOLUS OF MIN-COST SPANNING TREE GAMES IS NP-HARD
Authors: FAIGLE U KERN W KUIPERS J
Citation: U. Faigle et al., COMPUTING THE NUCLEOLUS OF MIN-COST SPANNING TREE GAMES IS NP-HARD, International journal of game theory, 27(3), 1998, pp. 443-450
SPECIAL VOLUME - 4TH TWENTE WORKSHOP ON GRAPHS AND COMBINATORIAL OPTIMIZATION - PREFACE
Authors: FAIGLE U HOEDE K
Citation: U. Faigle et K. Hoede, SPECIAL VOLUME - 4TH TWENTE WORKSHOP ON GRAPHS AND COMBINATORIAL OPTIMIZATION - PREFACE, Discrete applied mathematics, 79(1-3), 1997, pp. 1-1
ON THE COMPLEXITY OF TESTING MEMBERSHIP IN THE CORE OF MIN-COST SPANNING TREE GAMES
Authors: FAIGLE U KERN W FEKETE SP HOCHSTATTLER W
Citation: U. Faigle et al., ON THE COMPLEXITY OF TESTING MEMBERSHIP IN THE CORE OF MIN-COST SPANNING TREE GAMES, International journal of game theory, 26(3), 1997, pp. 361-366
A CHARACTERIZATION OF NONNEGATIVE BOX-GREEDY MATRICES
Authors: FAIGLE U HOFFMAN AJ KERN W
Citation: U. Faigle et al., A CHARACTERIZATION OF NONNEGATIVE BOX-GREEDY MATRICES, SIAM journal on discrete mathematics, 9(1), 1996, pp. 1-6
NOTE ON THE COMPUTATIONAL-COMPLEXITY OF J-RADII OF POLYTOPES IN R(N)
Authors: FAIGLE U KERN W STRENG M
Citation: U. Faigle et al., NOTE ON THE COMPUTATIONAL-COMPLEXITY OF J-RADII OF POLYTOPES IN R(N), Mathematical programming, 73(1), 1996, pp. 1-5
SUBMODULAR LINEAR-PROGRAMS ON FORESTS
Authors: FAIGLE U KERN W
Citation: U. Faigle et W. Kern, SUBMODULAR LINEAR-PROGRAMS ON FORESTS, Mathematical programming, 72(2), 1996, pp. 195-206
RANDOMIZED ONLINE ALGORITHMS FOR MAXIMIZING BUSY TIME-INTERVAL SCHEDULING
Authors: FAIGLE U GARBE R KERN W
Citation: U. Faigle et al., RANDOMIZED ONLINE ALGORITHMS FOR MAXIMIZING BUSY TIME-INTERVAL SCHEDULING, Computing, 56(2), 1996, pp. 95-104
A RANDOM POLYNOMIAL-TIME ALGORITHM FOR WELL-ROUNDING CONVEX-BODIES
Authors: FAIGLE U GADEMANN N KERN W
Citation: U. Faigle et al., A RANDOM POLYNOMIAL-TIME ALGORITHM FOR WELL-ROUNDING CONVEX-BODIES, Discrete applied mathematics, 58(2), 1995, pp. 117-144
NOTE ON SCHEDULING INTERVALS ONLINE
Authors: FAIGLE U NAWIJN WM
Citation: U. Faigle et Wm. Nawijn, NOTE ON SCHEDULING INTERVALS ONLINE, Discrete applied mathematics, 58(1), 1995, pp. 13-17
2ND TWENTE WORKSHOP ON GRAPHS AND COMBINATORIAL OPTIMIZATION - PREFACE
Authors: FAIGLE U HOEDE K
Citation: U. Faigle et K. Hoede, 2ND TWENTE WORKSHOP ON GRAPHS AND COMBINATORIAL OPTIMIZATION - PREFACE, Discrete applied mathematics, 51(1-2), 1994, pp. 1-1
COMPUTATIONAL-COMPLEXITY OF SOME MAXIMUM AVERAGE WEIGHT PROBLEMS WITHPRECEDENCE CONSTRAINTS
Authors: FAIGLE U KERN W
Citation: U. Faigle et W. Kern, COMPUTATIONAL-COMPLEXITY OF SOME MAXIMUM AVERAGE WEIGHT PROBLEMS WITHPRECEDENCE CONSTRAINTS, Operations research, 42(4), 1994, pp. 688-693
A CUTTING-PLANE APPROACH TO THE EDGE-WEIGHTED MAXIMAL CLIQUE PROBLEM
Authors: DIJKHUIZEN G FAIGLE U
Citation: G. Dijkhuizen et U. Faigle, A CUTTING-PLANE APPROACH TO THE EDGE-WEIGHTED MAXIMAL CLIQUE PROBLEM, European journal of operational research, 69(1), 1993, pp. 121-130
Risultati: 1-15 |