EURO Journal on Computational Optimization

Aims & Scope

The aim of this journal is to contribute to the many areas in which Operations Research and Computer Science are tightly connected with each other.

More precisely, the common element in all contributions to this journal is the use of computers for the solution of optimization problems.

Both methodological contributions and innovative applications are considered, but validation through convincing computational experiments is desirable.

The journal publishes three types of articles (i) research articles, (ii) tutorials, and (iii) surveys.

A research article presents original methodological contributions.

A tutorial provides an introduction to an advanced topic designed to ease the use of the relevant methodology.

A survey provides a wide overview of a given subject by summarizing and organizing research results.

Metrics & Ranking

Abstracting & Indexing

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

• Scopus
• Google Scholar
• Directory of Open Access Journals (DOAJ)
• Web of Science

Subjects & Keywords

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

Licensing & Copyright

This journal operates under an Open Access model. Articles are freely accessible to the public immediately upon publication. The content is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0), allowing users to share and adapt the work with proper attribution.

Copyright remains with the author(s), and no permission is required for non-commercial use, provided the original source is cited.

Policy Links

This section provides access to essential policy documents, guidelines, and resources related to the journal’s publication and submission processes.

• Aims scope
• Homepage
• Oa statement
• Author instructions
• License terms
• Review url
• Board url
• Copyright url
• Plagiarism url
• Preservation url
• Apc url
• License

Plagiarism Policy

This journal follows a plagiarism policy. All submitted manuscripts are screened using reliable plagiarism detection software to ensure originality and academic integrity. Authors are responsible for proper citation and acknowledgment of all sources, and any form of plagiarism, including self-plagiarism, will not be tolerated.

For more details, please refer to our official: Plagiarism Policy.

APC Details

The journal’s Article Processing Charge (APC) policies support open access publishing in Decision Sciences and Mathematics, ensuring accessibility and quality in research dissemination.

This journal requires an Article Processing Charge (APC) to support open access publishing, covering peer review, editing, and distribution. The current APC is 1,400.00 USD. Learn more.

Explore journals without APCs for alternative publishing options.

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.

• Variable neighborhood search: basics and variants

  Citation: 325

  Authors: Pierre, Nenad, Raca, Saïd

• A survey on matheuristics for routing problems

  Citation: 181

  Authors: Claudia, M.Grazia

• A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization

  Citation: 148

  Authors: Thomas, Martine, Ivana, Martin

• An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions

  Citation: 124

  Authors: Radu Ioan, Ernö Robert, Szilárd Csaba

• Two decades of blackbox optimization applications

  Citation: 84

  Authors: Stéphane, Charles, Aïmen E., Michael, Sébastien

• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints

  Citation: 59

  Authors: C., G., A.

• Progress in mathematical programming solvers from 2001 to 2020

  Citation: 52

  Authors: Thorsten, Timo, Jaap, Charlie

• A bounded degree SOS hierarchy for polynomial optimization

  Citation: 51

  Authors: JeanB., Kim-Chuan, Shouguang

• Worst case complexity of direct search

  Citation: 50

  Authors: L.N.

• Robust combinatorial optimization under convex and discrete cost uncertainty

  Citation: 45

  Authors: Christoph, Jannis