CrushSCI.com
454.4Average days
378Median days
257Fastest days
876Longest days
262025 publications

Paper Review Records

All Paper Review Records

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

579 days

Variable aggregation for nonlinear optimization problems

Authors
Sakshi Naik; Lorenz Biegler; Russell Bent; Robert ParkerShow moreShow less
Affiliations
1. Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, USA; 2. Applied Math and Plasma Physics Group, Los Alamos National Laboratory, Los Alamos, USAShow moreShow less
Source PDF DOI Publisher page
414 days

A decomposable branch-and-price formulation for optimal classification trees

Authors
Elif Rana Yöner; Taghi Khaniyev; Özlem KarsuShow moreShow less
Affiliations
1. Department of Industrial Engineering, Bilkent University, Ankara, Turkey; 2. Stephen M. Ross School of Business, University of Michigan, Ann Arbor, MI, USAShow moreShow less
Source PDF DOI Publisher page
595 days

Pessimistic bilevel optimization approach for decision–focused learning

Authors
Diego Jiménez; Bernardo Pagnoncelli; Hande YamanShow moreShow less
Affiliations
1. SKEMA Business School, Université Côte d’Azur, Lille, France; 2. Faculty of Economics and Business, KU Leuven, Leuven, BelgiumShow moreShow less
Source PDF DOI Publisher page
326 days

Political districting to maximize whole counties

Authors
Maral Shahmizad; Austin BuchananShow moreShow less
Affiliations
1. Industrial Engineering & Management, Oklahoma State University, Stillwater, USAShow moreShow less
Source PDF DOI Publisher page
308 days

An improved variant of the Iterated Inside Out algorithm for solving the optimal transport DOTmark instances

Authors
Roberto Bargetto; Federico Della Croce; Rosario ScatamacchiaShow moreShow less
Affiliations
1. Politecnico di Torino, Torino, ItalyShow moreShow less
Source PDF DOI Publisher page
876 days

A preconditioned interior point method for support vector machines using an ANOVA decomposition and NFFT-based matrix–vector products

Authors
Theresa Wagner; John W. Pearson; Martin StollShow moreShow less
Affiliations
1. Department of Mathematics, University of Technology Chemnitz, Chemnitz, Germany; 2. School of Mathematics and Maxwell Institute for Mathematical Sciences, The University of Edinburgh, Edinburgh, UKShow moreShow less
Source PDF DOI Publisher page

FAQ

How long does Mathematical Programming Computation take to review a manuscript?

As of 2026-11-16, CrushSCI has 15 complete review records for Mathematical Programming Computation. The fastest paper went from submission to acceptance in 257 days (Disciplined Geodesically Convex Programming: A Symbolic Framework for Verifying Geodesic Convexity, received 2025-08-20, accepted 2026-05-04); the slowest took 876 days. The average is 454.4 days and the median is 378 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.

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.