Mathematical Methods of Operations Research

1997 - 2025

Current editor(s): Oliver Stein

From:
Springer
Gesellschaft für Operations Research (GOR)
Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 49, issue 3, 1999

A parametric embedding for the finite minimax problem pp. 359-371

Francisco Guerra and Guillermo López

Location of a moving service facility pp. 373-393

Justo Puerto and Antonio M. Rodríguez-Chía

A characterization of the leximin solution of the bargaining problem pp. 395-400

Chih Chang and Yan-An Hwang

A perfectness concept for multicriteria games pp. 401-412

Peter Borm, Freek van Megen and Stef Tijs

Coalitional values and generalized characteristic functions pp. 413-433

Estela Sánchez and Gustavo Bergantiños

A counterexample on overtaking optimality pp. 435-439

Andrzej Nowak and Oscar Vega-Amaya

Nearly optimal stationary policies in negative dynamic programming pp. 441-456

Rolando Cavazos-Cadena and Raúl Montes- De-Oca

Average cost per unit time control of discrete time unreliable manufacturing systems with Markov demand pp. 457-473

Krzysztof Łazarski and Łukasz Stettner

A note on strong 1-optimal policies in Markov decision chains with unbounded costs pp. 475-482

Andrzej Nowak

A decomposition approach for undiscounted two-person zero-sum stochastic games pp. 483-500

Zeynep Müge Avsar and Melike Baykal-Gürsoy

Order picking in an automatic warehouse: Solving online asymmetric TSPs pp. 501-515

Norbert Ascheuer, Martin Grötschel and Atef Abdel-Aziz Abdel-Hamid

Volume 49, issue 2, 1999

A lower bound on the average number of Pivot-steps for solving linear programs Valid for all variants of the Simplex-Algorithm pp. 175-210

Karl Heinz Borgwardt and Petra Huhn

Scheduling identical jobs with chain precedence constraints on two uniform machines pp. 211-219

Peter Brucker, Johann Hurink and Wieslaw Kubiak

Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints pp. 221-238

Jürgen Zimmermann

Vector network equilibrium problems and nonlinear scalarization methods pp. 239-253

G. Y. Chen, C. J. Goh and X. Q. Yang

The finiteness of the reward function and the optimal value function in Markov decision processes pp. 255-266

Qiying Hu and Chen Xu

Two-person bilateral many-rounds poker pp. 267-282

Vladimir V. Mazalov, Svetlana V. Panova and Mojca Pis˘kuric˘

Repeated games with incomplete information and transportation problems pp. 283-298

Victor Domansky and Victoria Kreps

Controlled Markov chains with risk-sensitive criteria: Average cost, optimality equations, and optimal solutions pp. 299-324

Rolando Cavazos-Cadena and Emmanuel Fernández-Gaucherand

Bounds for a class of stochastic recursive equations pp. 325-333

Zhen Liu, Philippe Nain and Don Towsley

On tail probabilities and first passage times for fractional Brownian motion pp. 335-354

Zbigniew Michna

Volume 49, issue 1, 1999

Blackwell optimality in the class of stationary policies in Markov decision chains with a Borel state space and unbounded rewards pp. 1-39

Arie Hordijk and Alexander A. Yushkevich

Preemptive job-shop scheduling problems with a fixed number of jobs pp. 41-76

Peter Brucker, Svetlana A. Kravchenko and Yuri N. Sotskov

A note on the structure of value spaces in vector-valued Markov decision processes pp. 77-85

Kazuyoshi Wakuta

Nonstationary denumerable state Markov decision processes – with average variance criterion pp. 87-96

Xianping Guo

Asymptotic linear programming and policy improvement for singularly perturbed Markov decision processes pp. 97-109

Eitan Altman, Konstantin E. Avrachenkov and Jerzy A. Filar

The Elimination algorithm for the problem of optimal stopping pp. 111-123

Isaac Sonin

Equivalents of an approximate variational principle for vector-valued functions and applications pp. 125-136

G. Y. Chen, X. X. Huang and G. M. Lee

Scheduling trams in the morning pp. 137-148

Ulrich Blasum, Michael R. Bussieck, Winfried Hochstättler, Christoph Moll, Hans-Helmut Scheel and Thomas Winter

A two-cut approach in the analytic center cutting plane method pp. 149-169

Jean-Louis Goffin and Jean-Philippe Vial

Volume 48, issue 3, 1998

A global-filtering algorithm for linear programming problems with stochastic elements pp. 287-316

Sichong Guan and Shu-Cherng Fang

Optimal control of batch service queues with compound Poisson arrivals and finite service capacity pp. 317-335

Samuli Aalto

Optimal scheduling in heterogeneous two-station queueing networks pp. 337-347

Nicole Bäuerle, Gabi Brüstl and Ulrich Rieder

A unified approach to the existing three types of variational principles for vector valued functions pp. 349-357

G. Y. Chen and X. X. Huang

Heuristics for short route job shop scheduling problems pp. 359-375

Inna G. Drobouchevitch and Vitaly A. Strusevich

Determinateness of strategic games with a potential pp. 377-385

Henk Norde and Stef Tijs

Constrained Markov decision processes with total cost criteria: Lagrangian approach and dual linear program pp. 387-417

Eitan Altman

On a new approach to the analysis of complex multi-armed bandits pp. 419-442

R. Garbe and K. D. Glazebrook

Volume 48, issue 2, 1998

Special issue on `Set-valued optimization': Editors' preface pp. 151-152

Guang Ya Chen and Johannes Jahn

The Montagne Russe algorithm for global optimization pp. 153-168

Jean-Pierre Aubin and Laurent Najman

A nonconvex separation property in Banach spaces pp. 169-179

Jonathan M. Borwein and Alejandro Jofré

Ekeland's ε-variational principle for set-valued mappings pp. 181-186

Guang Ya Chen and X. X. Huang

Optimality conditions for set-valued optimization problems pp. 187-200

Guang Ya Chen and Johannes Jahn

Approximate fixed points for discontinuous set-valued mappings pp. 201-206

Shui-Hung Hou and Guang Ya Chen

Connectedness of super efficient sets in vector optimization of set-valued maps pp. 207-217

Zhong-Fei Li and Shou-Yang Wang

Existence of equilibria for monotone multivalued mappings pp. 219-228

Werner Oettli and Dirk Schläger

Cooperative behavior of functions, relations and sets pp. 229-246

Jean-Paul Penot

Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps pp. 247-258

Wei Dong Rong and Yu Nan Wu

A generalization of Fenchel duality in set-valued vector optimization pp. 259-272

Wen Song

Directional derivatives for set-valued mappings and applications pp. 273-285

X. Q. Yang

Volume 48, issue 1, 1998

Theory of maximum packing and related channel assignment strategies for cellular radio networks pp. 1-16

Jaakob Kind, Thomas Niessen and Rudolf Mathar

Beyond the cμ rule: Dynamic scheduling of a two-class loss queue pp. 17-36

Eungab Kim and Mark P. Van Oyen

Adaptive control for discrete-time Markov processes with unbounded costs: Average criterion pp. 37-55

Evgueni I. Gordienko and J. Adolfo Minjárez-Sosa

Closure spaces and restricted games pp. 57-69

Jesús Mario Bilbao

Population monotonic allocation schemes on externality games pp. 71-80

F. Grafe, Elena Inarra and J. M. Zarzuelo

Symmetric duality for minimax variational problems pp. 81-95

T. R. Gulati, Izhar Ahmad and I. Husain

Stability results for Ekeland's ε variational principle for vector valued functions pp. 97-103

G. Y. Chen and X. X. Huang

New cases of the cutting stock problem having MIRUP pp. 105-115

Christoph Nitsche, Guntram Scheithauer and Johannes Terno

Bayesian models in actuarial mathematics pp. 117-146

Klaus D. Schmidt