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,961 - 1,970 of 3,745
Cover Image
Conditions for the uniqueness of optimal policies of discounted Markov decision processes
Cruz-Suárez, Daniel; Montes-de-Oca, Raúl; … - In: Mathematical Methods of Operations Research 60 (2004) 3, pp. 415-436
This paper presents three conditions. Each of them guarantees the uniqueness of optimal policies of discounted Markov decision processes. The conditions presented here impose hypotheses specifically on the state space X, the action space A, the admissible action sets A(x),x∈X, the transition...
Persistent link: https://www.econbiz.de/10010999728
Saved in:
Cover Image
Global convergence of Newton’s method on an interval
Thorlund-Petersen, Lars - In: Mathematical Methods of Operations Research 59 (2004) 1, pp. 91-110
The solution of an equation f(x)=γ given by an increasing function f on an interval I and right-hand side γ, can be approximated by a sequence calculated according to Newton’s method. In this article, global convergence of the method is considered in the strong sense of convergence for any...
Persistent link: https://www.econbiz.de/10010999792
Saved in:
Cover Image
A characterization of exponential functionals in finite Markov chains
Rolando Cavazos–Cadena; Daniel Hernández–Hernández - In: Mathematical Methods of Operations Research 60 (2004) 3, pp. 399-414
This work considers Markov chains with finite state space. It is supposed that the process has a single recurrent class, but the set of transient states is not necessarily empty. In this context, a Varadhan’s function, giving the exponential grow rate of an aggregated cost function, is...
Persistent link: https://www.econbiz.de/10010999795
Saved in:
Cover Image
Smoothed Monte Carlo estimators for the time-in-the-red in risk processes
Makatis, G.; Zazanis, M. A. - In: Mathematical Methods of Operations Research 59 (2004) 2, pp. 329-342
We consider a modified version of the de Finetti model in insurance risk theory in which, when surpluses become negative the company has the possibility of borrowing, and thus continue its operation. For this model we examine the problem of estimating the “time-in-the red” over a finite...
Persistent link: https://www.econbiz.de/10010999837
Saved in:
Cover Image
Multicriteria impulsive control of jump Markov processes
Piunovskiy, A. B. - In: Mathematical Methods of Operations Research 60 (2004) 1, pp. 125-144
Impulsive control consideres so called interventions meaning immediate change of the state of the system; between intervention, the continuous time jump Markov process is uncontrollable, with “natural” jump intensities. Multicriteria control problem for such model is considered, and the...
Persistent link: https://www.econbiz.de/10010999884
Saved in:
Cover Image
Splitting graphs when calculating Myerson value for pure overhead games
Gómez, D.; González-Arangüena, E.; Manuel, C.; Owen, G. - In: Mathematical Methods of Operations Research 59 (2004) 3, pp. 479-489
A communication situation consists of a coalitional game and a graph, the nodes of the graph corresponding to the players of the game. To calculate the Myerson value for such situations, we obtain results which extend those well known for trees and cycle-complete graphs. On the other hand, in...
Persistent link: https://www.econbiz.de/10010999899
Saved in:
Cover Image
Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
Baptiste, Philippe; Timkovsky, Vadim G. - In: Mathematical Methods of Operations Research 60 (2004) 1, pp. 145-153
Ideal schedules reach both minimum maximum completion time and minimum total completion time of jobs. It is known that there exist computable in polynomial time ideal nonpreemptive two-machine schedules of unit-time operation jobs with equal release dates and arbitrary precedence constraints on...
Persistent link: https://www.econbiz.de/10010999907
Saved in:
Cover Image
Gap-free computation of Pareto-points by quadratic scalarizations
Fliege, Jörg - In: Mathematical Methods of Operations Research 59 (2004) 1, pp. 69-89
In multicriteria optimization, several objective functions have to be minimized simultaneously. For this kind of problem, approximations to the whole solution set are of particular importance to decision makers. Usually, approximating this set involves solving a family of parameterized...
Persistent link: https://www.econbiz.de/10010999911
Saved in:
Cover Image
Hedging of the European option in discrete time under proportional transaction costs
Kociński, Marek - In: Mathematical Methods of Operations Research 59 (2004) 2, pp. 315-328
In the paper hedging of the European option in a discrete time financial market with proportional transaction costs is studied. It is shown that for a certain class of options the set of portfolios which allow to hedge an option in a discrete time model with a bounded set of possible changes in...
Persistent link: https://www.econbiz.de/10010999940
Saved in:
Cover Image
Semistrictly quasiconvex mappings and non-convex vector optimization
Flores-Bazán, Fabián - In: Mathematical Methods of Operations Research 59 (2004) 1, pp. 129-145
This paper introduces a new class of non-convex vector functions strictly larger than that of P-quasiconvexity, with P⊆ [InlineMediaObject not available: see fulltext.]<Superscript> m </Superscript> being the underlying ordering cone, called semistrictly ( [InlineMediaObject not available: see fulltext.]<Superscript> m </Superscript>\ −int...</superscript></superscript>
Persistent link: https://www.econbiz.de/10010999956
Saved in:
  • First
  • Prev
  • 192
  • 193
  • 194
  • 195
  • 196
  • 197
  • 198
  • 199
  • 200
  • 201
  • 202
  • Next
  • Last
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...