


default search action
Mathematical Methods of Operations Research, Volume 101
Volume 101, Number 1, February 2025
- Alexander V. Gnedin, Zakaria Derbazi
:
The last-success stopping problem with random observation times. 1-27 - Esmaeil Babaei
:
On asset pricing in a binomial model with fixed and proportional transaction costs, portfolio constraints and dividends. 29-50 - Jamilu Abubakar, Parin Chaipunya, Poom Kumam
, Sani Salisu
:
A generalized scheme for split inclusion problem with conjugate like direction. 51-71 - Sunyoung Kim, Masakazu Kojima:
Equivalent sufficient conditions for global optimality of quadratically constrained quadratic programs. 73-94 - Boshi Tian
, Xiaoxing Chang:
A reweighted ℓ 1-penalty method for nonlinear complementarity problems. 95-110 - Zhiang Zhou
, Kehui Liang, Qamrul Hasan Ansari:
Optimality conditions for Benson proper efficiency of set-valued equilibrium problems. 111-134
Volume 101, Number 2, April 2025
- Lotte van Hezewijk
, Nico P. Dellaert
, Willem van Jaarsveld
:
On non-negative auto-correlated integer demand processes. 135-161 - Kerstin Lamert, Benjamin R. Auer, Ralf Wunderlich
:
Discretization of continuous-time arbitrage strategies in financial markets with fractional Brownian motion. 163-218 - François Dufour, Alexandre Génadot, Romain Namyst:
The bearing only localization problem via partially observed Markov decision process. 219-257 - Xiaoqin Wu, Zhijun Hu
:
Strategic capacity investment under demand ambiguity with creative destruction. 259-303 - Giovanni Paolo Crespi, Daishi Kuroiwa, Matteo Rocca:
Vector-valued games: characterization of equilibria in matrix games. 305-330 - C. E. Nwakpa, Austine Efut Ofem, Chinedu Izuchukwu
, Chibueze Christian Okeke:
Relaxed Inertial Subgradient Extragradient Algorithm for Solving Equilibrium Problems. 331-371

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.