CrushSCI.com
445.5Average days
362.5Median days
257Fastest days
876Longest days
262025 publications

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.

286 days

A sequential benders-based mixed-integer quadratic programming algorithm and its implementation in the Programming AI CAMINO Toolbox

Authors
Andrea Ghezzi; Wim Van Roy; Sebastian Sager; Moritz DiehlShow moreShow less
Affiliations
1. Department of Microsystems Engineering (IMTEK), University of Freiburg, Freiburg, Germany; 2. Department of Mechanical Engineering, KU Leuven, Leuven, Belgium; 3. Institute of Mathematical Optimization, Otto-von-Guericke Universität Magdeburg, Magdeburg, Germany; 4. Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg, Germany; 5. Department of Microsystems Engineering (IMTEK) and Department of Mathematics, University of Freiburg, Freiburg, GermanyShow moreShow less
Source PDF DOI Publisher page
347 days

Fix-and-propagate heuristics using low-precision first-order LP solutions for large-scale mixed-integer linear optimization

Authors
Nils-Christian Kempke; Thorsten KochShow moreShow less
Affiliations
1. Technical University Berlin, Chair of Software and Algorithms for Discrete Optimization, Berlin, Germany; 2. Zuse Institute Berlin, Applied Algorithmic Intelligence Methods, Berlin, GermanyShow moreShow less
Source PDF DOI Publisher page
378 days

NonOpt: Nonconvex, Nonsmooth Optimizer

Authors
Frank E. Curtis; Lara ZebianeShow moreShow less
Affiliations
1. Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, USAShow moreShow less
Source PDF DOI Publisher page
801 days

The boosted difference of convex functions algorithm for value-at-risk constrained portfolio optimization

Authors
Marah-Lisanne Thormann; Phan Tu Vuong; Alain B. ZemkohoShow moreShow less
Affiliations
1. School of Mathematical Sciences, University of Southampton, Southampton, UKShow moreShow less
Source PDF DOI Publisher page
482 days

An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization

Authors
Liang Chen; Youyicun Lin; Yuxuan ZhouShow moreShow less
Affiliations
1. School of Mathematics, Hunan University, Changsha, China; 2. Department of Mathematics, Southern University of Science and Technology, Shenzhen, ChinaShow moreShow less
Source PDF DOI Publisher page
280 days

A column generation approach to exact experimental design

Authors
Selin Damla Ahipaşaoğlu; Stefano Cipolla; Jacek GondzioShow moreShow less
Affiliations
1. School of Mathematical Sciences, University of Southampton, Southampton, UK; 2. School of Mathematics, The University of Edinburgh, Edinburgh, UKShow 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 review62 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 [email protected]

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