default search action
Search dblp for Publications
export results for "toc:db/journals/mmor/mmor99.bht:"
@article{DBLP:journals/mmor/AttouchL24, author = {H{\'{e}}dy Attouch and Szil{\'{a}}rd Csaba L{\'{a}}szl{\'{o}}}, title = {Convex optimization via inertial algorithms with vanishing Tikhonov regularization: fast convergence to the minimum norm solution}, journal = {Math. Methods Oper. Res.}, volume = {99}, number = {3}, pages = {307--347}, year = {2024}, url = {https://doi.org/10.1007/s00186-024-00867-y}, doi = {10.1007/S00186-024-00867-Y}, timestamp = {Fri, 19 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/AttouchL24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/BauerleJ24, author = {Nicole B{\"{a}}uerle and Anna Jaskiewicz}, title = {Markov decision processes with risk-sensitive criteria: an overview}, journal = {Math. Methods Oper. Res.}, volume = {99}, number = {1}, pages = {141--178}, year = {2024}, url = {https://doi.org/10.1007/s00186-024-00857-0}, doi = {10.1007/S00186-024-00857-0}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/BauerleJ24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/BertholdHS24, author = {Holger Berthold and Till Heller and Tobias Seidel}, title = {A unified approach to inverse robust optimization problems}, journal = {Math. Methods Oper. Res.}, volume = {99}, number = {1}, pages = {115--139}, year = {2024}, url = {https://doi.org/10.1007/s00186-023-00844-x}, doi = {10.1007/S00186-023-00844-X}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/BertholdHS24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/JianSY24, author = {Jiamin Jian and Qingshuo Song and Jiaxuan Ye}, title = {Convergence rate of {LQG} mean field games with common noise}, journal = {Math. Methods Oper. Res.}, volume = {99}, number = {3}, pages = {233--270}, year = {2024}, url = {https://doi.org/10.1007/s00186-024-00863-2}, doi = {10.1007/S00186-024-00863-2}, timestamp = {Fri, 19 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/JianSY24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/KetelaarsB24, author = {Martijn Ketelaars and Peter Borm}, title = {On the unification of centralized and decentralized clearing mechanisms in financial networks}, journal = {Math. Methods Oper. Res.}, volume = {99}, number = {3}, pages = {205--231}, year = {2024}, url = {https://doi.org/10.1007/s00186-024-00860-5}, doi = {10.1007/S00186-024-00860-5}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/KetelaarsB24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/Mehdiloozad24, author = {Mahmood Mehdiloozad}, title = {On proper separation of convex sets}, journal = {Math. Methods Oper. Res.}, volume = {99}, number = {3}, pages = {349--364}, year = {2024}, url = {https://doi.org/10.1007/s00186-024-00862-3}, doi = {10.1007/S00186-024-00862-3}, timestamp = {Fri, 19 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/Mehdiloozad24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/PerelPY24, author = {Efrat Perel and Nir Perel and Uri Yechiali}, title = {The non-preemptive 'Join the Shortest Queue-Serve the Longest Queue' service system with or without switch-over times}, journal = {Math. Methods Oper. Res.}, volume = {99}, number = {1}, pages = {3--38}, year = {2024}, url = {https://doi.org/10.1007/s00186-023-00848-7}, doi = {10.1007/S00186-023-00848-7}, timestamp = {Fri, 17 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/PerelPY24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/RenSLG24, author = {Yonghong Ren and Yuchao Sun and Dachen Li and Fangfang Guo}, title = {A {D.C.} approximation approach for optimization with probabilistic constraints based on Chen-Harker-Kanzow-Smale smooth plus function}, journal = {Math. Methods Oper. Res.}, volume = {99}, number = {1}, pages = {179--203}, year = {2024}, url = {https://doi.org/10.1007/s00186-024-00859-y}, doi = {10.1007/S00186-024-00859-Y}, timestamp = {Fri, 17 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/RenSLG24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/ShafieiKM24, author = {Allahkaram Shafiei and Vyacheslav Kungurtsev and Jakub Marecek}, title = {Trilevel and multilevel optimization using monotone operator theory}, journal = {Math. Methods Oper. Res.}, volume = {99}, number = {1}, pages = {77--114}, year = {2024}, url = {https://doi.org/10.1007/s00186-024-00852-5}, doi = {10.1007/S00186-024-00852-5}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/ShafieiKM24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/Stein24, author = {Oliver Stein}, title = {2023 {MMOR} best paper award}, journal = {Math. Methods Oper. Res.}, volume = {99}, number = {1}, pages = {1--2}, year = {2024}, url = {https://doi.org/10.1007/s00186-024-00853-4}, doi = {10.1007/S00186-024-00853-4}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/Stein24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/SunP24, author = {Ping Sun and Elena M. Parilina}, title = {Networks with nonordered partitioning of players: stability and efficiency with neighborhood-influenced cost topology}, journal = {Math. Methods Oper. Res.}, volume = {99}, number = {3}, pages = {271--305}, year = {2024}, url = {https://doi.org/10.1007/s00186-024-00861-4}, doi = {10.1007/S00186-024-00861-4}, timestamp = {Fri, 19 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/SunP24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/WangH24, author = {Qingsong Wang and Deren Han}, title = {Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks}, journal = {Math. Methods Oper. Res.}, volume = {99}, number = {1}, pages = {39--74}, year = {2024}, url = {https://doi.org/10.1007/s00186-024-00851-6}, doi = {10.1007/S00186-024-00851-6}, timestamp = {Fri, 17 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/WangH24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/WangH24a, author = {Qingsong Wang and Deren Han}, title = {Correction to: Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks}, journal = {Math. Methods Oper. Res.}, volume = {99}, number = {1}, pages = {75}, year = {2024}, url = {https://doi.org/10.1007/s00186-024-00855-2}, doi = {10.1007/S00186-024-00855-2}, timestamp = {Fri, 17 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/WangH24a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/ZidaniD24, author = {Nesrine Zidani and Natalia V. Djellab}, title = {Asymptotic upper bounds for an {M/M/C/K} retrial queue with a guard channel and guard buffer}, journal = {Math. Methods Oper. Res.}, volume = {99}, number = {3}, pages = {365--407}, year = {2024}, url = {https://doi.org/10.1007/s00186-024-00865-0}, doi = {10.1007/S00186-024-00865-0}, timestamp = {Fri, 19 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/ZidaniD24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.