Volume 52, Issue 1 | Mathematical Methods of Operations Research

Search all Mathematical Methods of Operations Research articles

Volume 52, Issue 1

September 2000

9 articles in this issue

Packing small boxes into a big box
Manfred Padberg
Pages: 1 - 21
Note on the computational complexity of least core concepts for min-cost spanning tree games
Ulrich Faigle
Walter Kern
Daniël Paulusma
Pages: 23 - 38
Communication situations with asymmetric players
Marco Slikker
Anne van den Nouweland
Pages: 39 - 56
Generalized vector quasi-equilibrium problems
Jun-Yi Fu
Pages: 57 - 64
Ideal equilibria in noncooperative multicriteria games
Mark Voorneveld
Sofia Grahn
Martin Dufwenberg
Pages: 65 - 77
General batch service disciplines – A product-form batch processing network with customer coalescence
Sonja Peterson
Pages: 79 - 97
Upper bound on the number of processors for scheduling with interprocessor communication delays
Aziz Moukrim
Pages: 99 - 113
Analysing sojourn times in queueing networks: A structural approach
Bernd Heidergott
Pages: 115 - 132
Nearly optimal policies in risk-sensitive positive dynamic programming on discrete spaces
Rolando Cavazos-Cadena
Raúl Montes-de-Oca
Pages: 133 - 167