Paper Review Records
All Paper Review Records
30 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
Heuristic algorithms for the stochastic critical node detection problem
Tuguldur Bayarsaikhan; Altannar Chinchuluun; Ashwin Arulselvan; Panos M. PardalosShow moreShow less
1. Department of Information and Computer Science, National University of Mongolia, Ulaanbaatar, Mongolia; 2. Business School, National University of Mongolia, Ulaanbaatar, Mongolia; 3. Department of Management Science, University of Strathclyde, Glasgow, UK; 4. Department of Industrial and Systems Engineering, University of Florida, Gainesville, USAShow moreShow less
Synaptic pruning for deep recurrent neural networks in PID controller autotuning
Aghil AhmadiShow moreShow less
1. Department of Electrical Engineering, Sahand University of Technology, Tabriz, IranShow moreShow less
Cost-sharing mechanism for the selfish concave bin packing problem
Zhikang Zhang; Kien Trung Nguyen; Weidong LiShow moreShow less
1. School of Mathematics and Statistics, Yunnan University, Kunming, China; 2. Faculty of Mathematics and Informatics, Teacher College, Can Tho University, Can Tho, VietnamShow moreShow less
Quadratic form estimations for Hessian matrices of resistance distance and Kirchhoff index of positive-weighted graphs
Yu Li; Lizhu Sun; Changjiang BuShow moreShow less
1. College of Mathematical Sciences, Harbin Engineering University, Harbin, People’s Republic of ChinaShow moreShow less
Brouwer-type inequality on the distance signless Laplacian eigenvalues of graphs with diameters 3 and 4
Yonghong Zhang; Ligong Wang; Rong MiaoShow moreShow less
1. School of Mathematics and Statistics, Weinan Normal University, Weinan, People’s Republic of China; 2. School of Mathematics and Statistics, Northwestern Polytechnical University, Xi’an, People’s Republic of China; 3. MOE Key Laboratory for Complexity Science in Aerospace, Northwestern Polytechnical University, Xi’an, People’s Republic of ChinaShow moreShow less
Asymmetric number partitioning with splitting
Samuel Bismuth; Erel Segal-Halevi; Dana ShapiraShow moreShow less
1. Department of Computer Science, Ariel University, Ariel, IsraelShow moreShow less
FAQ
How long does JOURNAL OF COMBINATORIAL OPTIMIZATION take to review a manuscript?
As of 2026-11-16, CrushSCI has 30 complete review records for JOURNAL OF COMBINATORIAL OPTIMIZATION. The fastest paper went from submission to acceptance in 3 days (The latest developments in combinatorial optimization, received 2026-06-30, accepted 2026-07-03); the slowest took 1179 days. The average is 430.3 days and the median is 328 days. The fastest record has an unusually short interval; please check the original source.
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.
