default search action
Mathematical Methods of Operations Research, Volume 61
Volume 61, Number 1, March 2005
- C. Gavrila, Jonathan P. Caulkins, Gustav Feichtinger, Gernot Tragler, Richard F. Hartl:
Managing the reputation of an award to motivate performance. 1-22 - Luca Grosset, Bruno Viscolani:
Minimum time problems in Economics. 23-32 - Yan-An Hwang, Wen-Hwa Li:
The core of multi-choice NTU games. 33-40 - Zheng-Hai Huang:
Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms. 41-55 - Antonio Gómez-Corral:
On a finite-buffer bulk-service queue with disasters. 57-84 - Dee Denteneer, A. J. E. M. Janssen, J. S. H. van Leeuwaarden:
Moment inequalities for the discrete-time bulk service queue. 85-108 - Christian Larsen:
Comparing two socially optimal work allocation rules when having a profit optimizing subcontractor with ample capacity. 109-121 - Tomás Prieto-Rumeau, Onésimo Hernández-Lerma:
The Laurent series, sensitive discount and Blackwell optimality for continuous-time controlled Markov chains. 123-145 - Kevin D. Glazebrook:
Optimal scheduling of tasks when service is subject to disruption: the preempt-repeat case. 147-169
Volume 61, Number 2, June 2005
- Martin Dahlgren:
Optimal sale strategies in illiquid markets. 173-190 - Jussi Keppo:
Pricing of point-to-point bandwidth contracts. 191-218 - Zhiping Chen, K. C. Yuen:
Optimal consumption and investment problems under GARCH with transaction costs. 219-237 - Jörn Sass:
Portfolio optimization under transaction costs in the CRR model. 239-259 - Juan Enrique Martínez-Legaz, Alexander M. Rubinov, Siegfried Schaible:
Increasing quasiconcave co-radiant functions with applications in mathematical economics. 261-280 - Jian-Wen Peng, Heung-Wing Joseph Lee, Wei Dong Rong, Xinmin Yang:
Hahn-Banach theorems and subgradients of set-valued maps. 281-297 - Zhenting Hou, Zheng Yu, Peng Shi:
Study on a class of nonlinear time series models and ergodicity in random environment domain. 299-310 - Yasemin Serin, Vidyadhar G. Kulkarni:
Markov decision processes under observability constraints. 311-328 - Kuo-Hsiung Wang, Yi-Chun Liu, Wen Lea Pearn:
Cost benefit analysis of series systems with warm standby components and general repair time. 329-343 - René Henrion:
Book Review. 345-346
Volume 61, Number 3, July 2005
- Alexey F. Izmailov, Mikhail V. Solodov:
A note on solution sensitivity for Karush-Kuhn-Tucker systems. 347-363 - Roberto Andreani, Cibele Dunder, José Mario Martínez:
Nonlinear-programming reformulation of the order-value optimization problem. 365-384 - Shengjie Li, Kok Lay Teo, Xiaoqi Yang:
Generalized vector quasi-equilibrium problems. 385-397 - Wei Li, Attahiru Sule Alfa:
Scheduling Stochastic jobs on a repairable machine with general phase type uptime. 399-417 - Kyoung Jin Choi, Hyeng Keun Koo:
A preference change and discretionary stopping in a consumption and porfolio selection problem. 419-435 - Tomás Prieto-Rumeau, Onésimo Hernández-Lerma:
Bias and overtaking equilibria for zero-sum continuous-time Markov games. 437-454 - Fernando Luque-Vásquez, J. Adolfo Minjárez-Sosa:
Semi-Markov control processes with unknown holding times distribution under a discounted criterion. 455-468 - Quanxin Zhu, Xianping Guo, Yonglong Dai:
Unbounded cost Markov decision processes with limsup and liminf average criteria: new conditions. 469-482 - Julio González-Díaz, Peter Borm, Ruud Hendrickx, Marieke Quant:
A geometric characterisation of the compromise value. 483-500 - Cristina Fernández, Peter Borm, Ruud Hendrickx, Stef Tijs:
Drop out monotonic rules for sequencing situations. 501-504 - Kuo-Hsiung Wang, Li-Ping Wang, Jau-Chuan Ke, Gang Chen:
Comparative analysis for the N policy M/G/1 queueing system with a removable and unreliable server. 505-520 - Mirjam Dür:
Book Review. 521-522
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.