default search action
Mathematical Methods of Operations Research, Volume 49
Volume 49, Number 1, March 1999
- Arie Hordijk, Alexander Yushkevich:
Blackwell optimality in the class of stationary policies in Markov decision chains with a Borel state space and unbounded rewards. 1-39 - Peter Brucker, Svetlana A. Kravchenko, Yuri N. Sotskov:
Preemptive job-shop scheduling problems with a fixed number of jobs. 41-76 - Kazuyoshi Wakuta:
A note on the structure of value spaces in vector-valued Markov decision processes. 77-85 - Xianping Guo:
Nonstationary denumerable state Markov decision processes - with average variance criterion. 87-96 - Eitan Altman, Konstantin Avrachenkov, Jerzy A. Filar:
Asymptotic linear programming and policy improvement for singularly perturbed Markov decision processes. 97-109 - Isaac Sonin:
The Elimination algorithm for the problem of optimal stopping. 111-123 - Guang-Ya Chen, X. X. Huang, Gue Myung Lee:
Equivalents of an approximate variational principle for vector-valued functions and applications. 125-136 - Ulrich Blasum, Michael R. Bussieck, Winfried Hochstättler, Christoph Moll, Hans-Helmut Scheel, Thomas Winter:
Scheduling trams in the morning. 137-148 - Jean-Louis Goffin, Jean-Philippe Vial:
A two-cut approach in the analytic center cutting plane method. 149-169
Volume 49, Number 2, April 1999
- Karl Heinz Borgwardt, Petra Huhn:
A lower bound on the average number of Pivot-steps for solving linear programs Valid for all variants of the Simplex-Algorithm. 175-210 - Peter Brucker, Johann L. Hurink, Wieslaw Kubiak:
Scheduling identical jobs with chain precedence constraints on two uniform machines. 211-219 - Jürgen Zimmermann:
Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints. 221-238 - G. Y. Chen, C. J. Goh, Xiaoqi Yang:
Vector network equilibrium problems and nonlinear scalarization methods. 239-253 - Qiying Hu, Chen Xu:
The finiteness of the reward function and the optimal value function in Markov decision processes. 255-266 - Vladimir V. Mazalov, Svetlana V. Panova, Mojca Piskuric:
Two-person bilateral many-rounds poker. 267-282 - Victor K. Domansky, Victoria L. Kreps:
Repeated games with incomplete information and transportation problems. 283-298 - Rolando Cavazos-Cadena, Emmanuel Fernández-Gaucherand:
Controlled Markov chains with risk-sensitive criteria: Average cost, optimality equations, and optimal solutions. 299-324 - Zhen Liu, Philippe Nain, Don Towsley:
Bounds for a class of stochastic recursive equations. 325-333 - Zbigniew Michna:
On tail probabilities and first passage times for fractional Brownian motion. 335-354
Volume 49, Number 3, July 1999
- Francisco Guerra, Guillermo López:
A parametric embedding for the finite minimax problem. 359-371 - Justo Puerto, Antonio M. Rodríguez-Chía:
Location of a moving service facility. 373-393 - Chih Chang, Yan-An Hwang:
A characterization of the leximin solution of the bargaining problem. 395-400 - Peter Borm, Freek van Megen, Stef Tijs:
A perfectness concept for multicriteria games. 401-412 - Estela Sánchez, Gustavo Bergantiños:
Coalitional values and generalized characteristic functions. 413-433 - Andrzej S. Nowak, Oscar Vega-Amaya:
A counterexample on overtaking optimality. 435-439 - Rolando Cavazos-Cadena, Raúl Montes-de-Oca:
Nearly optimal stationary policies in negative dynamic programming. 441-456 - Krzysztof Lazarski, Lukasz Stettner:
Average cost per unit time control of discrete time unreliable manufacturing systems with Markov demand. 457-473 - Andrzej S. Nowak:
A note on strong 1-optimal policies in Markov decision chains with unbounded costs. 475-482 - Zeynep Müge Avsar, Melike Baykal-Gürsoy:
A decomposition approach for undiscounted two-person zero-sum stochastic games. 483-500 - Norbert Ascheuer, Martin Grötschel, Atef Abdel-Aziz Abdel-Hamid:
Order picking in an automatic warehouse: Solving online asymmetric TSPs. 501-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.