Paper Review Records
All Paper Review Records
27 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
215
days
A clique-based adaptive neighbourhood search for the vehicle routing problem with simultaneous pickup and delivery
Authors
Napoleão Nepomuceno; Victor Tiezzi Henriques; Davi Otoch BarrosoShow moreShow less
Affiliations
Graduate Program in Applied Informatics, University of Fortaleza, Av. Washington Soares, 1321, Fortaleza, 60811-905, Ceará, BrazilShow moreShow less
361
days
An improved approximation algorithm for the Capacitated Arc Routing Problem
Authors
Jingyang Zhao; Mingyu XiaoShow moreShow less
Affiliations
University of Electronic Science and Technology of China, 2006 Xiyuan Ave, Chengdu, 610054, Sichuan, ChinaShow moreShow less
271
days
Reliable real-time value at risk estimation via quantile regression forest with conformal calibration
Authors
Du-Yi Wang; Guo Liang; Kun Zhang; Qianwen ZhuShow moreShow less
Affiliations
Institute of Statistics and Big Data, Renmin University of China, Beijing, China; Department of Decision Analytics and Operations, City University of Hong Kong, Kowloon, Hong Kong, China; Department of Data and Systems Engineering, The University of Hong Kong, Pokfulam, Hong Kong, China; School of Information, Renmin University of China, Beijing, ChinaShow moreShow less
313
days
A note on Lagrangian underestimate cuts and domain reduction techniques for integer programs
Authors
Jixuan Feng; Jun Xia; Silong Zhang; Zhou XuShow moreShow less
Affiliations
Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hong Kong, China; Data-Driven Management Decision Making Lab, Shanghai Jiao Tong University, Shanghai, China; Sino-US Global Logistics Institute, Antai College of Economics & Management, Shanghai Jiao Tong University, Shanghai, ChinaShow moreShow less
410
days
A machine learning-driven heuristic for an integrated lot-sizing, production–distribution and hub location problem
Authors
Jingwen Zhang; Xiaoning Zhang; Zhe Liang; Tao WuShow moreShow less
Affiliations
School of Economics and Management, Tongji University, Shanghai 200092, China; Laboratory of High Quality Urban Development and Strategic Decision, Tongji University, Shanghai 200092, ChinaShow moreShow less
251
days
A structure-guided reinforcement learning framework for joint scheduling and acceptance in R&D projects under technical risk
Authors
Xinyue Wang; Chaoming Hu; Haojun Fang; Zhiming Liu; Hao Cheng; Xinbao LiuShow moreShow less
Affiliations
School of Management, Hefei University of Technology, Hefei, 230009, China; Key Laboratory of Process Optimization and Intelligent Decision-Making, Ministry of Education, Hefei University of Technology, Hefei, 230009, ChinaShow moreShow less
FAQ
How long does COMPUTERS & OPERATIONS RESEARCH take to review a manuscript?
As of 2026-11-16, CrushSCI has 27 complete review records for COMPUTERS & OPERATIONS RESEARCH. The fastest paper went from submission to acceptance in 93 days (Evaluating sensitivity of distributionally robust optimization models, received 2026-05-09, accepted 2026-08-10); the slowest took 446 days. The average is 237.1 days and the median is 251 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.
