CrushSCI.com
473.4Average days
406Median days
189Fastest days
1,214Longest days
1172025 publications

Paper Review Records

All Paper Review Records

25 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.

621 days

Characterization of highly robust solutions in multi-objective programming in Banach spaces

Authors
Morteza Rahimi; Majid Soleimani-damanehShow moreShow less
Affiliations
1. Department of Mathematics, University of Antwerp, Antwerp, Belgium; 2. School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, IranShow moreShow less
Source PDF DOI Publisher page
1,214 days

A spatial branch-and-bound approach for maximization of differentiable monotone continuous submodular functions

Authors
Hugh Medal; Izuwa AhanorShow moreShow less
Affiliations
1. Department of Industrial and Systems Engineering, University of Tennessee-Knoxville, Knoxville, USAShow moreShow less
Source PDF DOI Publisher page
293 days

Projecting onto the unit dual quaternion set

Authors
Ziyang Li; Chunfeng Cui; Jiaxin XieShow moreShow less
Affiliations
1. School of Mathematical Sciences, Beihang University, Beijing, China; 2. LMIB, School of Mathematical Sciences, Beihang University, Beijing, ChinaShow moreShow less
Source PDF DOI Publisher page
688 days

A novel exact algorithm for economic lot-sizing with piecewise linear production costs

Authors
Kleitos PapadopoulosShow moreShow less
Affiliations
1. University of Leicester, Leicester, UKShow moreShow less
Source PDF DOI Publisher page
640 days

A distributed method hybridizing fully symmetric Peaceman–Rachford regularization with sequential quadratic programming for nonconvex-nonsmooth multi-block optimization

Authors
Jinbao Jian; Zhiwen Ren; Jianghua Yin; Deren HanShow moreShow less
Affiliations
1. School of Mathematical Sciences, Center for Applied Mathematics of Guangxi, Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis, Guangxi Minzu University, Nanning, China; 2. LMIB of the Ministry of Education, School of Mathematical Sciences, Beihang University, Beijing, ChinaShow moreShow less
Source PDF DOI Publisher page
615 days

Bishop-Phelps type scalarization for vector optimization in real topological-linear spaces

Authors
Christian Günther; Bahareh Khazayel; Radu Strugariu; Christiane TammerShow moreShow less
Affiliations
1. Institut für Angewandte Mathematik, Leibniz Universität Hannover, Hannover, Germany; 2. Institute of Mathematics, Martin Luther University Halle-Wittenberg, Faculty of Natural Sciences II, Halle (Saale), Germany; 3. Department of Mathematics and Informatics, Gheorghe Asachi Technical University of Iaşi, Iaşi, RomaniaShow moreShow less
Source PDF DOI Publisher page

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.

We will reply within 30 minutes.

CrushSCI online

Client

I work in environmental engineering and need an SCI paper published within three months. I have no grant funding or prominent co-author. Which journals could I target?

CrushSCI

Yes. We will first screen for feasibility against the 90-day deadline, then identify comparable papers without grant support or prominent co-authors. The final shortlist will prioritize research quality and journal scope.

Suggested title
Machine Learning and Life-Cycle Assessment for Predicting and Optimizing Carbon Emissions in Urban Wastewater Treatment

SampleLatest 5 valid paper samples from 2026

Average review59.6 days

Median65 days

Contact CrushSCI

Contact CrushSCI

Leave your email address to discuss academic polishing, structural refinement, or one-to-one guidance.

We will reply within 30 minutes.

Selected service: Academic Consulting Service

Leave your email address

Or email us directly at leader@crushsci.com

Enter your email address so we can reply. Your details will remain private.