Paper Review Records
All Paper Review Records
20 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
632
days
NP-completeness of neighborhood balanced colorings
Authors
Saeed AsaeediShow moreShow less
Affiliations
1. Department of Computer Science, Faculty of Mathematical Sciences, University of Kashan, Kashan, I. R. of IranShow moreShow less
207
days
Revisiting invex functions: explicit kernel constructions and characterizations
Authors
Akatsuki NishiokaShow moreShow less
Affiliations
1. Department of Mathematical and Computing Science, School of Computing, Institute of Science Tokyo, Meguro-ku, JapanShow moreShow less
227
days
Partially positive programming and its applications
Authors
Anwa Zhou; Qianhao Lu; Shiqian Yin; Jinyan FanShow moreShow less
Affiliations
1. Department of Mathematics, Shanghai University, Shanghai, People’s Republic of China; 2. School of Mathematical Sciences and MOE-LSC, Shanghai Jiao Tong University, Shanghai, People’s Republic of ChinaShow moreShow less
770
days
An improved approximation algorithm for sweep coverage with distance constraint
Authors
Yubai Zhang; Zhao Zhang; Ganggang Li; Zhiqing JiangShow moreShow less
Affiliations
1. School of Information Management and Mathematics, Jiangxi University of Finance and Economics, Nanchang, People’s Republic of China; 2. School of Mathematical Sciences, Zhejiang Normal University, Jinhua, People’s Republic of ChinaShow moreShow less
374
days
A new class of stochastic absolute value equations
Authors
Jingyong Tang; Rongge ChenShow moreShow less
Affiliations
1. School of Mathematics and Statistics, Xinyang Normal University, Xinyang, ChinaShow moreShow less
185
days
More on the properties of solution set of absolute value equations
Authors
Shweta Yadav; Dipti DubeyShow moreShow less
Affiliations
1. Department of Mathematics, Shiv Nadar Institution of Eminence, Dadri, IndiaShow moreShow less
FAQ
How long does Optimization Letters take to review a manuscript?
As of 2026-11-16, CrushSCI has 20 complete review records for Optimization Letters. The fastest paper went from submission to acceptance in 89 days (Weighted robust optimality for nonsmooth semi-infinite problems with a fair-learning model, received 2026-06-07, accepted 2026-09-04); the slowest took 846 days. The average is 349 days and the median is 246 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.
