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 2,581 - 2,590 of 3,745
Cover Image
Consumption-investment problems with transaction costs: Survey and open problems
Cadenillas, Abel - In: Mathematical Methods of Operations Research 51 (2000) 1, pp. 43-68
We present a survey of problems and methods contained in various works on consumption-investment problems with transaction costs in continuous time. The methods are those of optimal stopping, stochastic singular control, and stochastic impulse control. We also describe some open problems in this...
Persistent link: https://www.econbiz.de/10010950108
Saved in:
Cover Image
Upper bound on the number of processors for scheduling with interprocessor communication delays
Moukrim, Aziz - In: Mathematical Methods of Operations Research 52 (2000) 1, pp. 99-113
The problem of scheduling a task system with communication delays on multiprocessor systems is known to be NP-hard in its general form as well as many restricted cases even on an unlimited number of processors. In this paper, we study the problem of determining an upper bound on the minimum...
Persistent link: https://www.econbiz.de/10010950109
Saved in:
Cover Image
Optimal control of batch service queues with finite service capacity and linear holding costs
Aalto, Samuli - In: Mathematical Methods of Operations Research 51 (2000) 2, pp. 263-285
We consider the optimal control problem of certain batch service queueing systems with compound Poisson arrivals and linear holding costs. The control problem involves the determination of the epochs at which the service is initiated as well as the sizes of the batches served. The service times...
Persistent link: https://www.econbiz.de/10010950139
Saved in:
Cover Image
A convex dual approach to the computation of NMR complex spectra
Borwein, Jonathan M.; Maréchal, Pierre; Naugler, David - In: Mathematical Methods of Operations Research 51 (2000) 1, pp. 91-102
The particular entropy method proposed by Hoch et al. [7] for the computation of NMR complex spectra allows an elegant application of the concepts of duality theory. Correspondingly, duality theory casts new light on their choice of entropy. The purpose of this paper is to present the relevant...
Persistent link: https://www.econbiz.de/10010950144
Saved in:
Cover Image
Packing small boxes into a big box
Padberg, Manfred - In: Mathematical Methods of Operations Research 52 (2000) 1, pp. 1-21
The three-dimensional orthogonal packing problem consists of filling a big rectangular box with as many small rectangular boxes as possible. In a recent paper G. Fasano (Alenia Aerospazio, Turin) has given a mixed-integer programming formulation of this problem. Here we extend Fasano's...
Persistent link: https://www.econbiz.de/10010950164
Saved in:
Cover Image
An approximation algorithm for the stack-up problem
Rethmann, Jochen; Wanke, Egon - In: Mathematical Methods of Operations Research 51 (2000) 2, pp. 203-233
We consider the combinatorial stack-up problem motivated by stacking up bins from a conveyor onto pallets. The stack-up problem is to decide whether a given list q of labeled objects can be processed by removing step by step one of the first s objects of q so that the following holds. After each...
Persistent link: https://www.econbiz.de/10010950178
Saved in:
Cover Image
Optimal portfolios for exponential Lévy processes
Kallsen, Jan - In: Mathematical Methods of Operations Research 51 (2000) 3, pp. 357-374
We consider the problem of maximizing the expected utility from consumption or terminal wealth in a market where logarithmic securities prices follow a Lévy process. More specifically, we give explicit solutions for power, logarithmic and exponential utility in terms of the Lévy-Khintchine...
Persistent link: https://www.econbiz.de/10010950180
Saved in:
Cover Image
General batch service disciplines – A product-form batch processing network with customer coalescence
Peterson, Sonja - In: Mathematical Methods of Operations Research 52 (2000) 1, pp. 79-97
A new batch service discipline is introduced that allows for customers of different classes to leave together in one batch. This so-called general batch service discipline is discussed for servers with signals and class-independent or class-dependent exponential service times. The equilibrium...
Persistent link: https://www.econbiz.de/10010950202
Saved in:
Cover Image
An inventory system for perishable items with by-products
Perry, David; Stadje, Wolfgang - In: Mathematical Methods of Operations Research 51 (2000) 2, pp. 287-300
We present models for inventory systems with perishable commodities (PISs) in which the items are not scrapped after reaching their maximum lifetime but are transferred to a second PIS where they are used to satisfy another random stream of demands. We determine the steady-state distribution of...
Persistent link: https://www.econbiz.de/10010950221
Saved in:
Cover Image
PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem
Klein, Robert; Scholl, Armin - In: Mathematical Methods of Operations Research 52 (2000) 3, pp. 467-488
This paper deals with the generalized resource-constrained project scheduling problem (GRCPSP) which extends the well-known resource-constrained project scheduling problem (RCPSP) by considering job specific release and due dates, non-negative minimum start-to-start time lags as well as...
Persistent link: https://www.econbiz.de/10010950224
Saved in:
  • First
  • Prev
  • 254
  • 255
  • 256
  • 257
  • 258
  • 259
  • 260
  • 261
  • 262
  • 263
  • 264
  • Next
  • Last
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...