Discrete Optimization

Aims & Scope

Discrete Optimization publishes research papers on the mathematical, computational and applied aspects of all areas of integer programming and combinatorial optimization.

In addition to reports on mathematical results pertinent to discrete optimization, the journal welcomes submissions on algorithmic developments, computational experiments, and novel applications (in particular, large-scale and real-time applications).

The journal also publishes clearly labelled surveys, reviews, short notes, and open problems.

Manuscripts submitted for possible publication to Discrete Optimization should report on original research, should not have been previously published, and should not be under consideration for publication by any other journal.

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	1.6

SJR (SCImago Journal Rank)

Year	Value
2024	0.473

Quartile

Year	Value
2024	Q2

h-index

Year	Value
2024	44

Journal Rank

Year	Value
2024	12131

Journal Citation Indicator

Year	Value
2024	121

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science and Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• An algorithmic framework for convex mixed integer nonlinear programs

  Citation: 617

  Authors: Pierre, Lorenz T., Andrew R., Gérard, Ignacio E., Carl D., Jon, Andrea, François, Nicolas, Andreas

• Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning

  Citation: 402

  Authors: David R., Sheldon H., Jason J., Edward C.

• Bike sharing systems: Solving the static rebalancing problem

  Citation: 382

  Authors: Daniel, Frédéric, Roberto

• Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

  Citation: 271

  Authors: Giovanni, Matteo

• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints

  Citation: 159

  Authors: Claudio, Rafael

• The two-dimensional bin packing problem with variable bin sizes and costs

  Citation: 130

  Authors: David, Mikkel

• Improving the feasibility pump

  Citation: 128

  Authors: Tobias, Timo

• Computing robust basestock levels

  Citation: 115

  Authors: Daniel, Nuri

• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

  Citation: 114

  Authors: Hideki, Mutsunori, Toshihide

• A feasibility pump heuristic for general mixed-integer problems

  Citation: 109

  Authors: Livio, Matteo, Andrea

---