Paper Review Records
All Paper Review Records
14 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
249
days
Greedy algorithms with imprecise oracles for submodular knapsack problems
Authors
Sabine Münch; Stephen RaachShow moreShow less
Affiliations
1. Trier University, Trier, GermanyShow moreShow less
207
days
Sequencing games with batch-ordered jobs
Authors
Iago Núñez Lugilde; Arantza Estévez-Fernández; Estela Sánchez-RodríguezShow moreShow less
Affiliations
1. SiDOR, Departamento de Estatística e Investigación Operativa, Universidade de Vigo, Edificio Xurídico-Empresarial, Ourense, Spain; 2. Department of Operations Analytics, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands; 3. CITMAga, SiDOR, Departamento de Estatística e Investigación Operativa, Universidade de Vigo, Facultade de Ciencias Económicas e Empresariais, Vigo, SpainShow moreShow less
268
days
Optimal weighted reinsurance contract in a Stackelberg-Nash differential game with negotiation
Authors
Qingqing Zhang; Zhibin LiangShow moreShow less
Affiliations
1. School of Finance, Shanghai University of International Business and Economics, Shanghai, P.R. China; 2. School of Mathematical Sciences, Ministry of Education Key Laboratory for NSLSCS, Nanjing Normal University, Nanjing, ChinaShow moreShow less
467
days
A modified diagonally scaled memoryless quasi-Newton method for nonconvex multiobjective optimization problems
Authors
Qingjie Hu; Ruyun Li; Yu ChenShow moreShow less
Affiliations
1. Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, Center for Applied Mathematics of Guangxi (GUET), School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin, People’s Republic of China; 2. School of Mathematics and Statistics, Guangxi Normal University, Guilin, People’s Republic of ChinaShow moreShow less
122
days
Optimality and duality for quasiconvex semi-infinite programming problems in terms of GP-subdifferential
Authors
Shashi Kant Mishra; Soumya Rath; Umashankar BajpeiShow moreShow less
Affiliations
1. Department of Mathematics, Institute of Science, Banaras Hindu University, Varanasi, IndiaShow moreShow less
408
days
Robust Competitive Ratio for Deterministic Monopoly Pricing
Authors
Tim S. G. van Eck; Pieter Kleer; Johan S. H. van LeeuwaardenShow moreShow less
Affiliations
1. Department of Econometrics and Operations Research, Tilburg University, Tilburg, NetherlandsShow moreShow less
FAQ
How long does MATHEMATICAL METHODS OF OPERATIONS RESEARCH take to review a manuscript?
As of 2026-11-16, CrushSCI has 14 complete review records for MATHEMATICAL METHODS OF OPERATIONS RESEARCH. The fastest paper went from submission to acceptance in 122 days (Optimality and duality for quasiconvex semi-infinite programming problems in terms of GP-subdifferential, received 2026-02-21, accepted 2026-06-23); the slowest took 467 days. The average is 299 days and the median is 293 days.
Expert Matching · Case Demo
Turn Your Submission Goalsinto a Verifiable Journal Plan
Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.
