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.

Volume 101, issue 1, 2025

The last-success stopping problem with random observation times pp. 1-27

Alexander Gnedin and Zakaria Derbazi

On asset pricing in a binomial model with fixed and proportional transaction costs, portfolio constraints and dividends pp. 29-50

Esmaeil Babaei

A generalized scheme for split inclusion problem with conjugate like direction pp. 51-71

Jamilu Abubakar, Parin Chaipunya, Poom Kumam and Sani Salisu

Equivalent sufficient conditions for global optimality of quadratically constrained quadratic programs pp. 73-94

Sunyoung Kim and Masakazu Kojima

A reweighted $$\ell _1$$ ℓ 1 -penalty method for nonlinear complementarity problems pp. 95-110

Boshi Tian and Xiaoxing Chang

Optimality conditions for Benson proper efficiency of set-valued equilibrium problems pp. 111-134

Zhiang Zhou, Kehui Liang and Qamrul Hasan Ansari

Volume 100, issue 3, 2024

Editorial pp. 601-601

Oliver Stein

Whittle index approach to the multi-class queueing systems with convex holding costs and IHR service times pp. 603-634

Samuli Aalto

Inverse demand tracking in transportation networks pp. 635-668

Simone Göttlich, Patrick Mehlitz and Thomas Schillinger

Priority coalitional games and claims problems pp. 669-701

Iago Núñez Lugilde, Arantza Estévez-Fernández and Estela Sánchez-Rodríguez

Designing sustainable diet plans by solving triobjective integer programs pp. 703-721

Luca Benvenuti, Alberto Santis, Marianna Santis and Daniele Patria

Forward-reflected-backward and shadow-Douglas–Rachford with partial inverse for solving monotone inclusions pp. 723-752

Fernando Roldán

100 volumes of Mathematical Methods of Operations Research: a bibliometric overview pp. 753-796

Luciano Barcellos-Paula, José M. Merigó and Anna M. Gil-Lafuente

Volume 100, issue 2, 2024

How to project onto the intersection of a closed affine subspace and a hyperplane pp. 411-435

Heinz H. Bauschke, Dayou Mao and Walaa M. Moursi

Discrete-time stopping games with risk-sensitive discounted cost criterion pp. 437-466

Wenzhao Zhang and Congying Liu

Low-complexity algorithm for restless bandits with imperfect observations pp. 467-508

Keqin Liu, Richard Weber and Chengzhong Zhang

Tropical convexity in location problems pp. 509-534

Andrei Comăneci

A new value for communication situations pp. 535-551

Daniel Li Li and Erfang Shan

Multi-stage distributionally robust convex stochastic optimization with Bayesian-type ambiguity sets pp. 553-600

Wentao Ma and Zhiping Chen

Volume 100, issue 1, 2024

Special issue on exact and approximation methods for mixed-integer multi-objective optimization pp. 1-4

Carlos Henggeler Antunes, Carlos M. Fonseca, Luís Paquete and Michael Stiglmayr

Approximating multiobjective optimization problems: How exact can you be? pp. 5-25

Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen and Daniel Vanderpooten

Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory pp. 27-63

Stephan Helfrich, Arne Herzel, Stefan Ruzika and Clemens Thielen

Complexity of the multiobjective minimum weight minimum stretch spanner problem pp. 65-83

Fritz Bökler and Henning Jasper

Augmenting bi-objective branch and bound by scalarization-based information pp. 85-121

Julius Bauß and Michael Stiglmayr

Column generation based solution for bi-objective gate assignment problems pp. 123-151

Gülesin Sena Daş and Fatma Gzara

Combining discrete and continuous information for multi-criteria optimization problems pp. 153-173

Katrin Teichert, Tobias Seidel and Philipp Süss

On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem pp. 175-220

Samira Fallah, Ted K. Ralphs and Natashia L. Boland

A fast and robust algorithm for solving biobjective mixed integer programs pp. 221-262

Diego Pecin, Ian Herszterg, Tyler Perini, Natashia Boland and Martin Savelsbergh

An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems pp. 263-290

Fritz Bökler, Sophie N. Parragh, Markus Sinnl and Fabien Tricoire

A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems pp. 291-320

Gabriele Eichfelder and Leo Warnow

An approximation algorithm for multiobjective mixed-integer convex optimization pp. 321-350

Ina Lammel, Karl-Heinz Küfer and Philipp Süss

A simple, efficient and versatile objective space algorithm for multiobjective integer programming pp. 351-384

Kerstin Dächert, Tino Fleuren and Kathrin Klamroth

A test instance generator for multiobjective mixed-integer optimization pp. 385-410

Gabriele Eichfelder, Tobias Gerlach and Leo Warnow

Volume 99, issue 3, 2024

On the unification of centralized and decentralized clearing mechanisms in financial networks pp. 205-231

Martijn W. Ketelaars and Peter Borm

Convergence rate of LQG mean field games with common noise pp. 233-270

Jiamin Jian, Qingshuo Song and Jiaxuan Ye

Networks with nonordered partitioning of players: stability and efficiency with neighborhood-influenced cost topology pp. 271-305

Ping Sun and Elena Parilina

Convex optimization via inertial algorithms with vanishing Tikhonov regularization: fast convergence to the minimum norm solution pp. 307-347

Hedy Attouch and Szilárd Csaba László

On proper separation of convex sets pp. 349-364

Mahmood Mehdiloo

Asymptotic upper bounds for an M/M/C/K retrial queue with a guard channel and guard buffer pp. 365-407

Nesrine Zidani and Natalia Djellab

Volume 99, issue 1, 2024

2023 MMOR best paper award pp. 1-2

Oliver Stein

The non-preemptive ‘Join the Shortest Queue–Serve the Longest Queue’ service system with or without switch-over times pp. 3-38

Efrat Perel, Nir Perel and Uri Yechiali

Stochastic Gauss–Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks pp. 39-74

Qingsong Wang and Deren Han

Correction to: Stochastic Gauss–Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks pp. 75-75

Qingsong Wang and Deren Han

Trilevel and multilevel optimization using monotone operator theory pp. 77-114

Allahkaram Shafiei, Vyacheslav Kungurtsev and Jakub Marecek

A unified approach to inverse robust optimization problems pp. 115-139

Holger Berthold, Till Heller and Tobias Seidel

Markov decision processes with risk-sensitive criteria: an overview pp. 141-178

Nicole Bäuerle and Anna Jaśkiewicz

A D.C. approximation approach for optimization with probabilistic constraints based on Chen–Harker–Kanzow–Smale smooth plus function pp. 179-203

Yonghong Ren, Yuchao Sun, Dachen Li and Fangfang Guo

Volume 98, issue 3, 2023

A singular stochastic control problem with direction switching cost pp. 325-349

Łukasz Kruk

Analysis of a two-class queueing system with service times dependent on the presence of a certain class pp. 351-376

Sara Sasaninejad, Joris Walraevens, Arnaud Devos and Sabine Wittevrongel

Investment strategies of duopoly firms with asymmetric time-to-build under a jump-diffusion model pp. 377-410

Yanyun Liu and Baiqing Sun

A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints pp. 411-433

Li Dong, Zhengyong Zhou and Li Yang

Directional and approximate efficiency in set optimization pp. 435-459

Marius Durea and Elena-Andreea Florea

Solving quasimonotone and non-monotone variational inequalities pp. 461-498

V. A. Uzor, T. O. Alakoya, O. T. Mewomo and A. Gibali

Volume 98, issue 2, 2023

Binary programming formulations for the upper domination problem pp. 155-168

Ryan Burdett, Michael Haythorpe and Alex Newcombe

Stochastic Mitra–Wan forestry models analyzed as a mean field optimal control problem pp. 169-203

Carmen G. Higuera-Chan, Leonardo R. Laura-Guarachi and J. Adolfo Minjárez-Sosa

Optimal stopping and impulse control in the presence of an anticipated regime switch pp. 205-230

Luis H. R. Alvarez E. and Wiljami Sillanpää

Risk filtering and risk-averse control of Markovian systems subject to model uncertainty pp. 231-268

Tomasz R. Bielecki, Igor Cialenco and Andrzej Ruszczyński

Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem pp. 269-297

Alexander Belyi, Stanislav Sobolevsky, Alexander Kurbatski and Carlo Ratti

An algorithm for quasiconvex equilibrium problems and asymptotically nonexpansive mappings: application to a Walras model with implicit supply–demand pp. 299-324

Nguyen Ngoc Hai, Le Dung Muu and Bui Dinh

Volume 98, issue 1, 2023

Computational analysis of $$GI^{[X]}/D$$ G I [ X ] / D - $$MSP^{(a,b)}/1$$ M S P ( a, b ) / 1 queueing system via RG-factorization pp. 1-39

Kousik Das and Sujit Kumar Samanta

Correction to: Computational analysis of GI[X] /D-MSP(a,b) /1 queueing system via RG-factorization pp. 41-41

Kousik Das and Sujit Kumar Samanta

Approximation algorithms for stochastic online matching with reusable resources pp. 43-56

Meghan Shanks, Ge Yu and Sheldon H. Jacobson

On egalitarian values for cooperative games with level structures pp. 57-73

J. M. Alonso-Meijide, J. Costa, I. García-Jurado and J. C. Gonçalves-Dosantos

Contractive approximations in average Markov decision chains driven by a risk-seeking controller pp. 75-91

Gustavo Portillo-Ramírez, Rolando Cavazos-Cadena and Hugo Cruz-Suárez

A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints pp. 93-109

Zhuoyi Xu, Linbin Li and Yong Xia

Bin stretching with migration on two hierarchical machines pp. 111-153

Islam Akaria and Leah Epstein