Health Score

0 Fair

Metadata coverage

Abstract

ORCID

References

License

Extended metadata coverage

Informational — signals of interoperability and funding across the corpus. Not part of the health score.

Funding

Funder

Award / grant

Affiliation & institutional identifiers

Affiliation

ROR ID

Update policy

Your prioritized action plan

Ordered by how many DOIs each fix touches — start here, not with every error at once.

Attach ORCID iDs across 48 articles

ORCID iDs strengthen author disambiguation and institutional reporting.

High impact48 DOIs

Add license metadata to 43 records

License metadata tells indexers and readers how each article may be reused.

High impact43 DOIs

DOIs for this ISSN

Showing the top 5 of 50 DOIs, ordered by correction priority.

#	Title	Missing	Priority	Citations
1	Frameworks and Results in Distributionally Robust Optimizati… (10.5802/ojmo.15)	ORCID License	112.03	173
2	On the implementation of a global optimization method for mi… (10.5802/ojmo.3)	ORCID License	66.11	20
3	Non-Convex Split Feasibility Problems: Models, Algorithms an… (10.5802/ojmo.1)	ORCID License	55.70	12
4	Adaptive Cut Selection in Mixed-Integer Linear Programming (10.5802/ojmo.25)	ORCID License	55.70	12
5	Short Paper - A note on the Frank–Wolfe algorithm for a clas… (10.5802/ojmo.21)	ORCID License	42.25	6
6	Quadratic error bound of the smoothed gap and the restarted… (10.5802/ojmo.26)	ORCID License	34.95	4
7	Combinatorial Robust Optimization with Decision-Dependent In… (10.5802/ojmo.33)	ORCID License	34.95	4
8	Robust Combinatorial Optimization with Locally Budgeted Unce… (10.5802/ojmo.5)	ORCID License	34.95	4
9	A note on approximate accelerated forward-backward methods w… (10.5802/ojmo.12)	ORCID License	30.10	3
10	Short Paper - A Note on Robust Combinatorial Optimization wi… (10.5802/ojmo.23)	ORCID License	30.10	3
11	Exact makespan minimization of unrelated parallel machines (10.5802/ojmo.4)	ORCID License	30.10	3
12	Trading off 1-norm and sparsity against rank for linear mode… (10.5802/ojmo.6)	ORCID License	30.10	3
13	The difference vectors for convex sets and a resolution of t… (10.5802/ojmo.7)	ORCID License	30.10	3
14	The Referenced Vertex Ordering Problem: Theory, Applications… (10.5802/ojmo.8)	ORCID License	30.10	3
15	Gradient formulae for probability functions depending on a h… (10.5802/ojmo.9)	ORCID License	30.10	3
16	AC Optimal Power Flow: a Conic Programming relaxation and an… (10.5802/ojmo.17)	ORCID License	23.86	2
17	The backtrack Hölder gradient method with application to min… (10.5802/ojmo.24)	ORCID License	23.86	2
18	Connections between Robust and Bilevel Optimization (10.5802/ojmo.38)	ORCID	22.58	7
19	Efficient optimization of the Held–Karp lower bound (10.5802/ojmo.11)	ORCID License	15.05	1
20	Characterizations of Stability of Error Bounds for Convex In… (10.5802/ojmo.13)	ORCID License	15.05	1
21	Tight computationally efficient approximation of matrix norm… (10.5802/ojmo.19)	ORCID License	15.05	1
22	Revisiting a Cutting-Plane Method for Perfect Matchings (10.5802/ojmo.2)	ORCID License	15.05	1
23	The continuous quadrant penalty formulation of logical const… (10.5802/ojmo.28)	ORCID License	15.05	1
24	An interior proximal gradient method for nonconvex optimizat… (10.5802/ojmo.30)	ORCID License	15.05	1
25	Tight analyses for subgradient descent I: Lower bounds (10.5802/ojmo.31)	ORCID License	15.05	1
26	Iterative Linear Quadratic Optimization for Nonlinear Contro… (10.5802/ojmo.32)	ORCID License	15.05	1
27	Stochastic Differential Inclusions and Tikhonov Regularizati… (10.5802/ojmo.44)	ORCID License	15.05	1
28	Theoretical analysis of the randomized subspace regularized… (10.5802/ojmo.46)	ORCID License	15.05	1
29	Grid is Good. Adaptive Refinement Algorithms for Off-the-Gri… (10.5802/ojmo.39)	ORCID	7.53	1
30	A Stochastic Objective-Function-Free Adaptive Regularization… (10.5802/ojmo.41)	ORCID	7.53	1
31	One to beat them all: “RYU” – a unifying framework for the c… (10.5802/ojmo.45)	ORCID	7.53	1
32	Estimating Shape Parameters of Piecewise Linear-Quadratic Pr… (10.5802/ojmo.10)	ORCID License	0.00	0
33	Screening for a Reweighted Penalized Conditional Gradient Me… (10.5802/ojmo.14)	ORCID License	0.00	0
34	Equivariant Perturbation in Gomory and Johnson’s Infinite Gr… (10.5802/ojmo.16)	ORCID License	0.00	0
35	Cycle-based formulations in Distance Geometry (10.5802/ojmo.18)	ORCID License	0.00	0
36	Convergence Rates of Gradient Methods for Convex Optimizatio… (10.5802/ojmo.20)	ORCID License	0.00	0
37	Inertial-relaxed splitting for composite monotone inclusions (10.5802/ojmo.22)	ORCID License	0.00	0
38	Cardinality-constrained structured data-fitting problems (10.5802/ojmo.27)	ORCID License	0.00	0
39	Optimizing transient gas network control for challenging rea… (10.5802/ojmo.29)	License	0.00	0
40	Short Paper - The Binary Linearization Complexity of Pseudo-… (10.5802/ojmo.34)	ORCID License	0.00	0
41	First order algorithms for computing linear and polyhedral e… (10.5802/ojmo.35)	ORCID License	0.00	0
42	Short Paper - Quadratic minimization: from conjugate gradien… (10.5802/ojmo.36)	ORCID License	0.00	0
43	An Exponentially Converging Particle Method for the Mixed Na… (10.5802/ojmo.37)	ORCID	0.00	0
44	The Robust Bilevel Selection Problem (10.5802/ojmo.40)		0.00	0
45	Network Localization and Multi-Dimensional Scaling: Escaping… (10.5802/ojmo.42)	ORCID	0.00	0
46	Learning structured approximations of combinatorial optimiza… (10.5802/ojmo.43)	ORCID License	0.00	0
47	Multi-Objective Trust-Region Filter Method for Nonlinear Con… (10.5802/ojmo.47)	ORCID License	0.00	0
48	Good and Fast Row-Sparse ah-Symmetric Reflexive Generalized… (10.5802/ojmo.48)	ORCID License	0.00	0
49	Exploiting Agent Symmetries for Performance Analysis of Dist… (10.5802/ojmo.49)	ORCID License	0.00	0
50	Unifying view on sparse convex relaxations in polynomial opt… (10.5802/ojmo.50)	ORCID License	0.00	0