Academic Journal
Q2Discrete Optimization
About Discrete Optimization
Discrete Optimization is a scholarly journal published by Elsevier B.V.. SCImago 2025 lists it in Q2, with an SJR of 0.504 and H-index of 46.
Coverage: 2004-2026. Research categories: Applied Mathematics (Q2); Computational Theory and Mathematics (Q2); Theoretical Computer Science (Q3).
Source-backed journal facts
Topics in published research
Advanced Graph Theory Research; Complexity and Algorithms in Graphs; Vehicle Routing Optimization Methods; Optimization and Search Problems; Optimization and Packing Problems; Diverse Scientific and Economic Studies.
OpenAlex classifies topics from published works. These topics are not the publisher’s official aims and scope.
Reported open-access list prices
2,760.00 USD; 2,580.00 EUR; 2,210.00 GBP; 342,320.00 JPY
APC list prices reported by OpenAlex, which obtains this information from DOAJ. Confirm current charges, taxes, waivers and eligibility with the publisher; this is not a fee quotation.
Source: OpenAlex source record. Retrieved 2026-10-03. Source record updated 2026-10-02. OpenAlex metrics are different from SCImago metrics and the Clarivate Journal Impact Factor.
Journal Metrics
Quartile, SJR and the listed SCImago H-index use the 2025 imported SCImago dataset. A quartile may vary by subject category. Values without a source or reporting year are unverified historical entries. Verify the current Journal Impact Factor with Clarivate or the publisher before using it.
Aims & Scope
The publisher’s official aims and scope have not yet been verified for this profile. Use the journal website to check subject fit and accepted article types before submitting.
Recent Research Articles
Latest publications matched automatically by ISSN.
Leximin budget allocation across heterogeneous budgeted Markov decision processes
Hideaki Goto
2026-12 · DOI: 10.1016/j.disopt.2026.100972The exact value of c1(K2,n)
Hiroaki Mori
2026-12 · DOI: 10.1016/j.disopt.2026.100961Maximum atom bond sum connectivity index of cacti
Fangxia Wang, Chuanyan Hou, Siyi Chen, Fei Guo et al.
2026-12 · DOI: 10.1016/j.disopt.2026.100960The restricted edge-connectivity of the Cartesian product of graphs
Hazhe Ye, Dandan Fan
2026-12 · DOI: 10.1016/j.disopt.2026.100970The strongly stable roommates problem and linear programming
Naoyuki Kamiyama
2026-12 · DOI: 10.1016/j.disopt.2026.100969Extremal Q-index problem in outerplanar graphs
Jin Cai, Leyou Xu, Bo Zhou
2026-12 · DOI: 10.1016/j.disopt.2026.100971Spectral radius and size conditions for fractional (a,b,l)-critical graphs
Zengzhao Xu, Ligong Wang, Weige Xi
2026-08 · DOI: 10.1016/j.disopt.2026.100958On the isolation number of graphs with minimum degree four
Wayne Goddard, Michael A. Henning
2026-08 · DOI: 10.1016/j.disopt.2026.100959The red–blue–yellow matching problem
Manuel Aprile, Marco Di Summa
2026-08 · DOI: 10.1016/j.disopt.2026.100956The inverse 1-median problem on median graphs under l2-norm
Kien Trung Nguyen, Nguyen Thanh Hung, Nguyen Thanh Luan, Cao Minh Quang et al.
2026-08 · DOI: 10.1016/j.disopt.2026.100957Editorial Board
2026-08 · DOI: 10.1016/s1572-5286(26)00038-1Vertex packing linear programs and critical independent sets
C.E. Larson
2026-08 · DOI: 10.1016/j.disopt.2026.100955Online speed-robust scheduling
Leah Epstein
2026-08 · DOI: 10.1016/j.disopt.2026.100954The parametric matroid ℓ-interdiction problem
Nils Hausbrandt, Stefan Ruzika
2026-05 · DOI: 10.1016/j.disopt.2026.100937On the weak k-metric dimension of Hamming graphs
Elena Fernández, Sandi Klavžar, Dorota Kuziak, Manuel Muñoz-Márquez et al.
2026-05 · DOI: 10.1016/j.disopt.2026.100945Inverse of the Gomory corner relaxation of integer programs
George Lyu, Fatemeh Nosrat, Andrew J. Schaefer
2026-05 · DOI: 10.1016/j.disopt.2026.100943The length polyhedron of an interval order
Csaba Biró, André E. Kézdy, Jenő Lehel
2026-05 · DOI: 10.1016/j.disopt.2026.100938Editorial Board
2026-05 · DOI: 10.1016/s1572-5286(26)00023-xAn optimization approach to degree deviation and spectral radius
Dieter Rautenbach, Florian Werner
2026-05 · DOI: 10.1016/j.disopt.2026.100939Lower bounds on the performance of online algorithms for relaxed packing problems
János Balogh, György Dósa, Leah Epstein, Łukasz Jeż et al.
2026-05 · DOI: 10.1016/j.disopt.2026.100941Reviews
Community Reviews
Version History
October 4, 2026 at 9:18 pm
October 2, 2026