EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: isPartOf:"Mathematical Methods of Operations Research"
Narrow search

Narrow search

Year of publication
Subject
All
Theorie 734 Theory 734 Mathematical programming 362 Mathematische Optimierung 360 Spieltheorie 151 Game theory 147 Stochastic process 117 Stochastischer Prozess 117 Markov chain 108 Portfolio selection 107 Markov-Kette 103 Portfolio-Management 103 Cooperative game 85 Kooperatives Spiel 78 Dynamic programming 68 Unternehmensforschung 63 Algorithm 56 Algorithmus 56 Warteschlangentheorie 56 Queueing theory 55 Entscheidung 52 Multi-criteria analysis 51 Multikriterielle Entscheidungsanalyse 51 Nash equilibrium 50 Dynamische Optimierung 49 Shapley value 48 Integer programming 43 Core 42 Scheduling problem 40 Nash-Gleichgewicht 39 Scheduling-Verfahren 39 Risiko 38 Decision 37 Risk 37 Programming 36 Shapley-Wert 36 Kontrolltheorie 34 Option pricing theory 34 Optionspreistheorie 34 Control theory 31
more ... less ...
Online availability
All
Undetermined 1,249 Free 122 CC license 1
Type of publication
All
Article 3,737 Book / Working Paper 8
Type of publication (narrower categories)
All
Article in journal 1,014 Aufsatz in Zeitschrift 1,014 Article 47 Collection of articles of several authors 6 Sammelwerk 6 Aufsatzsammlung 3 Festschrift 1 Systematic review 1 Übersichtsarbeit 1
more ... less ...
Language
All
Undetermined 2,606 English 1,128 German 11
Author
All
Borm, Peter 38 Tijs, Stef 34 Cavazos-Cadena, Rolando 28 Hernández-Lerma, Onésimo 25 Nowak, Andrzej S. 25 Bäuerle, Nicole 24 Brucker, Peter 19 Hordijk, Arie 19 Korn, Ralf 19 Altman, Eitan 18 Puerto, Justo 17 Wang, Kuo-Hsiung 17 Hamers, Herbert 16 Montes-de-Oca, Raúl 16 Nickel, Stefan 15 Perry, David 15 Wanka, Gert 15 Berman, Oded 14 Guo, Xianping 14 Ke, Jau-Chuan 14 Rieder, Ulrich 14 Weismantel, Robert 14 Bayraktar, Erhan 13 Fang, Shu-Cherng 13 Filar, Jerzy A. 13 Norde, Henk 13 Stadje, Wolfgang 13 Teneketzis, Demosthenis 13 Thielen, Clemens 13 Algaba, E. 12 Bergantiños, Gustavo 12 Fragnelli, Vito 12 Gordienko, Evgueni 12 Koch, Thorsten 12 Koster, Maurice 12 Woeginger, Gerhard J. 12 Bruneel, Herwig 11 Hendrickx, Ruud 11 Martin, Alexander 11 Sass, Jörn 11
more ... less ...
Institution
All
DGOR-Arbeitsgruppe "Praxis der Linearen Optimierung (PRALINE)" 1
Published in...
All
Mathematical methods of operations research 1,870 Mathematical Methods of Operations Research 1,052 Zeitschrift für Operations-Research : ZOR ; mathematical methods of operations research 633 Mathematical methods of operations research : ZOR 190
Source
All
ECONIS (ZBW) 1,505 OLC EcoSci 1,188 RePEc 1,005 EconStor 47
Showing 1,941 - 1,950 of 3,745
Cover Image
Retailer’s optimal ordering policy under supplier credits
Chang, Chun-Tao; Teng, Jinn-Tsair - In: Mathematical Methods of Operations Research 60 (2004) 3, pp. 471-483
In the traditional inventory economic order quantity (or EOQ) model, it was assumed that the customer must pay for the items as soon as the items are received. However, in practices, the supplier frequently offers a cash discount and/or a permissible delay to the customer especially when the...
Persistent link: https://www.econbiz.de/10010950315
Saved in:
Cover Image
The unbalance and bounds on the average waiting time for periodic routing to one queue
Hordijk, Arie; Laan, Dinard van der - In: Mathematical Methods of Operations Research 59 (2004) 1, pp. 1-23
In this paper we introduce the combinatorial notion of unbalance for a periodic zero-one splitting sequence. Using this unbalance we derive an upper bound for the average expected waiting time of jobs which are routed to one queue according to a periodic zero-one splitting sequence. In the...
Persistent link: https://www.econbiz.de/10010950328
Saved in:
Cover Image
Equivalence classes for optimizing risk models in Markov decision processes
Ohtsubo, Yoshio; Toyonaga, Kenji - In: Mathematical Methods of Operations Research 60 (2004) 2, pp. 239-250
We consider eight problems in which we maximize or minimize threshold probabilities in discounted Markov decision processes with bounded reward set. We show that such problems are classified to two equivalence classes and give a relationship between optimal values and optimal policies of...
Persistent link: https://www.econbiz.de/10010950368
Saved in:
Cover Image
A dynamic programming approach to solve efficient frontier
Sadjadi, S. J.; Aryanezhad, M. B.; Moghaddam, B. F. - In: Mathematical Methods of Operations Research 60 (2004) 2, pp. 203-214
This paper presents a closed form solution of the mean-variance portfolio selection problem for uncorrelated assets that precludes short sells. We also study the problem with the consideration of transaction cost. When the asset holding can be explicitly become available, one can have a better...
Persistent link: https://www.econbiz.de/10010950374
Saved in:
Cover Image
Perishable inventory systems with variable input and demand rates
Nahmias, Steven; Perry, David; Stadje, Wolfgang - In: Mathematical Methods of Operations Research 60 (2004) 1, pp. 155-162
We consider a certain class of perishable inventory systems with items and demands arriving at random times. The shelf lifetime of every item is finite and deterministic. Every demand is for a single item and is satisfied by the oldest item on the shelf, if available. Generalizing previous work,...
Persistent link: https://www.econbiz.de/10010950378
Saved in:
Cover Image
Weighted allocation rules for standard fixed tree games
Bjørndal, Endre; Koster, Maurice; Tijs, Stef - In: Mathematical Methods of Operations Research 59 (2004) 2, pp. 249-270
In this paper we consider standard fixed tree games, for which each vertex unequal to the root is inhabited by exactly one player. We present two weighted allocation rules, the weighted down-home allocation and the weighted neighbour-home allocation, both inspired by the painting story in...
Persistent link: https://www.econbiz.de/10010999533
Saved in:
Cover Image
Dual methods for probabilistic optimization problems<Superscript>*</Superscript>
Dentcheva, Darinka; Lai, Bogumila; Ruszczyński, Andrzej - In: Mathematical Methods of Operations Research 60 (2004) 2, pp. 331-346
We consider nonlinear stochastic optimization problems with probabilistic constraints. The concept of a p-efficient point of a probability distribution is used to derive equivalent problem formulations, and necessary and sufficient optimality conditions. We analyze the dual functional and its...
Persistent link: https://www.econbiz.de/10010999538
Saved in:
Cover Image
Semi-infinite weighted Markov decision processes with perturbation
Abbad, Mohammed; Rahhali, Khalid - In: Mathematical Methods of Operations Research 60 (2004) 2, pp. 251-265
In this paper, Weighted reward Perturbed Markov Decision Processes with finite state and countable action spaces (semi-infinite WMDP for short) are considered. The ”weighted reward” refers to appropriately normalized convex combination of the discounted and the long-run average reward...
Persistent link: https://www.econbiz.de/10010999575
Saved in:
Cover Image
Construction of Nash equilibria in symmetric stochastic games of capital accumulation
Balbus, Łukasz; Nowak, Andrzej S. - In: Mathematical Methods of Operations Research 60 (2004) 2, pp. 267-277
A large class of nonzero-sum symmetric stochastic games of capital accumulation/resource extraction is considered. An iterative method leading to a Nash equilibrium in the infinite horizon game with the discounted evaluation is studied. Copyright Springer-Verlag 2004
Persistent link: https://www.econbiz.de/10010999579
Saved in:
Cover Image
Periodic routing to parallel queues and billiard sequences
Hordijk, Arie; Laan, Dinard van der - In: Mathematical Methods of Operations Research 59 (2004) 2, pp. 173-192
In this companion paper of [10] we introduce the combinatorial notion of unbalance for a routing pattern. Using this unbalance we derive an upper bound for the total average expected waiting time of jobs which are routed to parallel queues according to a periodic routing rule. A billiard...
Persistent link: https://www.econbiz.de/10010999582
Saved in:
  • First
  • Prev
  • 190
  • 191
  • 192
  • 193
  • 194
  • 195
  • 196
  • 197
  • 198
  • 199
  • 200
  • Next
  • Last
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...