default search action
Mathematical Methods of Operations Research, Volume 59
Volume 59, Number 1, February 2004
- Arie Hordijk, Dinard van der Laan:
The unbalance and bounds on the average waiting time for periodic routing to one queue. 1-23 - Thomas M. Liebling, Gianpaolo Oriolo, Bianca Spille, Gautier Stauffer:
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs. 25-35 - Johannes Jahn, Andreas Kirsch, Carmen Wagner:
Optimization of rod antennas of mobile phones. 37-51 - K. T. Lee, S. T. Chin:
Strategies to serve or receive the service in volleyball. 53-67 - Jörg Fliege:
Gap-free computation of Pareto-points by quadratic scalarizations. 69-89 - Lars Thorlund-Petersen:
Global convergence of Newton's method on an interval. 91-110 - Alexander Szimayer:
A reduced form model for ESO valuation. 111-128 - Fabián Flores Bazán:
Semistrictly quasiconvex mappings and non-convex vector optimization. 129-145 - Encarnación Algaba Durán, Jesús Mario Bilbao, René van den Brink, Andrés Jiménez-Losada:
An axiomatization of the Banzhaf value for cooperative games on antimatroids. 147-166
Volume 59, Number 2, June 2004
- Arie Hordijk, Dinard van der Laan:
Periodic routing to parallel queues and billiard sequences. 173-192 - Dino Ahr, József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt:
An exact algorithm for scheduling identical coupled tasks. 193-203 - Michael R. Bussieck, Thomas Lindner, Marco E. Lübbecke:
A fast algorithm for near cost optimal line plans. 205-220 - Alberto Zaffaroni:
Is every radiant function the sum of quasiconvex functions? 221-233 - Amir Beck, Marc Teboulle:
A conditional gradient method with linear rate of convergence for solving convex linear systems. 235-247 - Endre Bjørndal, Maurice Koster, Stef Tijs:
Weighted allocation rules for standard fixed tree games. 249-270 - Ruud Hendrickx:
Inheritance of properties in NTU communication situations. 271-286 - Roland Maier, Johannes Mayer, Volker Schmidt:
Distributional properties of the typical cell of stationary iterated tessellations. 287-302 - Volodymyr Koshmanenko:
Theorem of conflicts for a pair of probability measures. 303-313 - Marek Kocinski:
Hedging of the European option in discrete time under proportional transaction costs. 315-328 - G. Makatis, Michael A. Zazanis:
Smoothed Monte Carlo estimators for the time-in-the-red in risk processes. 329-342
Volume 59, Number 3, July 2004
- Peter Borm, Henk Norde, Ignacio García-Jurado, Fioravante Patrone:
Preface. 347-348 - Ignacio García-Jurado, Luciano Méndez-Naya, César Sánchez-Sellero:
Density estimation using game theory. 349-357 - Jason M. Shachat, J. Todd Swarthout:
Do we detect and exploit mixed strategy play by opponents? 359-373 - Marcel Dreef, Peter Borm, Ben van der Genugten:
Measuring skill in games: several approaches discussed. 375-391 - Gustavo Bergantiños, Leticia Lorenzo:
A non-cooperative approach to the cost spanning tree problem. 393-403 - Endre Bjørndal, Herbert Hamers, Maurice Koster:
Cost allocation in a bank ATM network. 405-418 - Stefano Moretti, Fioravante Patrone:
Cost allocation games with information costs. 419-434 - Paula González, Carmen Herrero:
Optimal sharing of surgical costs in the presence of queues. 435-446 - Vito Fragnelli, Anna Iandolino:
A cost allocation problem in urban solid wastes collection and disposal. 447-463 - Encarnación Algaba Durán, Jesús Mario Bilbao, J. J. López:
The position value in communication structures. 465-477 - Daniel Gómez, Enrique González-Arangüena, Conrado Manuel, Guillermo Owen, Mónica del Pozo, Juan Tejada:
Splitting graphs when calculating Myerson value for pure overhead games. 479-489 - Imma J. Curiel:
A game-theoretic analysis of the political structure of the Netherlands Antilles. 491-502 - Francesc Carreras:
On the design of voting games. 503-515
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.