Mathematical Methods of Operations Research

1997 - 2025

Current editor(s): Oliver Stein

From:
Springer
Gesellschaft für Operations Research (GOR)
Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

The integral basis method for integer programming pp. 353-361: Utz-Uwe Haus, Matthias Köppe and Robert Weismantel
New class of 0-1 integer programs with tight approximation via linear relaxations pp. 363-370: A. S. Asratian and N. N. Kuzjurin
Dynamic order replenishment policy in internet-based supply chains pp. 371-390: Oded Berman and Eungab Kim
Some existence results of efficiency in vector optimization pp. 391-401: X. X. Huang and X. M. Yang
Optimality conditions in non-convex set-valued optimization pp. 403-417: Fabián Flores-Bazán
Multiobjective duality for convex-linear problems II pp. 419-433: Gert Wanka and Radu-Ioan Boţ
A steepest ascent approach to maximizing the net present value of projects pp. 435-450: Christoph Schwindt and Jürgen Zimmermann
Algorithms for aggregated limiting average Markov decision problems pp. 451-463: Mohammed Abbad and Cherki Daoui
Weighted Markov decision processes with perturbation pp. 465-480: Ke Liu and Jerzy A. Filar
Optimal control of arrivals in tandem queues of constant service time pp. 481-491: Hsing Luh and Ulrich Rieder
Shortfall risk minimization under model uncertainty in the binomial case: adaptive and robust approaches pp. 493-503: Gino Favero
Variations of the Cox-Ross-Rubinstein model – conservative pricing strategies pp. 505-515: Marcus Wrede and Norbert Schmitz

Classical cuts for mixed-integer programming and branch-and-cut pp. 173-203: Manfred Padberg
Characterizations of efficient points in convex vector optimization problems pp. 205-214: Kristin Winkler
Generalized properly efficient solutions of vector optimization problems pp. 215-232: D. E. Ward and G. M. Lee
On cone characterizations of weak, proper and Pareto optimality in multiobjective optimization pp. 233-245: Kaisa Miettinen and Marko M. Mäkelä
Duality for portfolio optimization with short sales pp. 247-263: Gert Wanka and Lars Göhler
A multiobjective control approach to priority queues pp. 265-277: Onésimo Hernández-Lerma and Luis F. Hoyos-Reyes
Markov decision processes with a stopping time constraint pp. 279-295: Masayuki Horiguchi
A note for “On an inventory model for deteriorating items and time-varying demand” pp. 297-307: Peter Chu and Patrick S. Chen
Numerical evaluation of resolvents and Laplace transforms of Markov processes using linear programming pp. 309-331: Kurt Helmes and Richard H. Stockbridge
The Shapley value for games on matroids: The static model pp. 333-348: J. M. Bilbao, T. S. H. Driessen, A. Jiménez Losada and E. Lebrón

Optimal switching problem for countable Markov chains: average reward criterion pp. 1-24: Alexander Yushkevich
Strong duality of the general capacity problem in metric spaces pp. 25-34: J. Rigoberto Gabriel and Onésimo Hernández-Lerma
Two extensions of the Shapley value for cooperative games pp. 35-49: T. S. H. Driessen and D. Paulusma
Convex games and feasible sets in control theory pp. 51-66: Stefan Pickl
Pricing of the American option in discrete time under proportional transaction costs pp. 67-88: Marek Kociński
Solving optimal stopping problems of linear diffusions by applying convolution approximations pp. 89-99: Luis Alvarez
Extended and strongly extended well-posedness of set-valued optimization problems pp. 101-116: X. X. Huang
Burst arrival queues with server vacations and random timers pp. 117-146: Merav Shomrony and Uri Yechiali
A multi-item continuous review inventory system with compound Poisson demands pp. 147-165: K. Ohno and T. Ishigaki

Batching identical jobs pp. 355-367: Philippe Baptiste
Scheduling UET task systems with concurrency on two parallel identical processors pp. 369-387: Peter Brucker, Sigrid Knust, Duncan Roper and Yakov Zinder
Competitive genetic algorithms for the open-shop scheduling problem pp. 389-411: Christian Prins
A branch-and-bound algorithm for the resource-constrained project scheduling problem pp. 413-439: U. Dorndorf, E. Pesch and T. Phan-Huy
Active and stable project scheduling pp. 441-465: K. Neumann, H. Nübel and C. Schwindt
PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem pp. 467-488: Robert Klein and Armin Scholl
Solving the discrete-continuous project scheduling problem via its discretization pp. 489-499: Joanna Józefowska, Marek Mika, Rafał Różycki, Grzegorz Waligóra and Jan Weglarz
Linear preselective policies for stochastic project scheduling pp. 501-515: Rolf H. Möhring and Frederik Stork

The bounce algorithm for mathematical programming pp. 173-183: H. A. Eiselt and C.-L. Sandblom
Stability in vector-valued and set-valued optimization pp. 185-193: X. X. Huang
The efficient frontier for bounded assets pp. 195-212: Michael J. Best and Jaroslava Hlouskova
Pension funds insurance individuation pp. 213-220: Charles S. Tapiero and Assa Birati
The position value for union stable systems pp. 221-236: E. Algaba, J. M. Bilbao, Peter Borm and J. J. López
On a game in manufacturing pp. 237-249: V. J. Baston and A. Y. Garnaev
On shortest path games pp. 251-264: Vito Fragnelli, Ignacio García-Jurado and Luciano Méndez-Naya
Nonzero-sum non-stationary discounted Markov game model pp. 265-270: Rangcheng Jia and Yuanyao Ding
Constrained Markov control processes in Borel spaces: the discounted case pp. 271-285: Onésimo Hernández-Lerma and Juan González-Hernández
A new strong optimality criterion for nonstationary Markov decision processes pp. 287-306: Xianping Guo, Peng Shi and Weiping Zhu
Asymptotic behaviour of the tandem queueing system with identical service times at both queues pp. 307-323: O. J. Boxma and Qimin Deng
The combinatorial complexity of masterkeying pp. 325-348: Wolfgang Espelage and Egon Wanke

Packing small boxes into a big box pp. 1-21: Manfred Padberg
Note on the computational complexity of least core concepts for min-cost spanning tree games pp. 23-38: Ulrich Faigle, Walter Kern and Daniël Paulusma
Communication situations with asymmetric players pp. 39-56: Marco Slikker and Anne van den Nouweland
Generalized vector quasi-equilibrium problems pp. 57-64: Jun-Yi Fu
Ideal equilibria in noncooperative multicriteria games pp. 65-77: Mark Voorneveld, Sofia Grahn and Martin Dufwenberg
General batch service disciplines – A product-form batch processing network with customer coalescence pp. 79-97: Sonja Peterson
Upper bound on the number of processors for scheduling with interprocessor communication delays pp. 99-113: Aziz Moukrim
Analysing sojourn times in queueing networks: A structural approach pp. 115-132: Bernd Heidergott
Nearly optimal policies in risk-sensitive positive dynamic programming on discrete spaces pp. 133-167: Rolando Cavazos-Cadena and Raúl Montes- de-Oca