Back to Top
Go Back
Journal Photo for European Journal of Operational Research
Peer reviewed only Open Access

European Journal of Operational Research (EJOR)

Publisher : Elsevier B.V.
Applied Mathematics Modelling Simulation
Claim Your Journal Get PRC Visit Website
e-ISSN 1872-6860
p-ISSN 0377-2217
Issue Frequency Monthly
Impact Factor 6.0
Est. Year 1977
Mobile 31204853911
Country Netherlands The
Language English
APC YES
Impact Factor Assignee Google Scholar
Email journalscustomerserviceEMEA@elsevier.com

Journal Descriptions

Published in collaboration with the Association of European Operational Research Societies (EURO) The European Journal of Operational Research (EJOR) publishes high quality, original papers that contribute to the methodology of operational research (OR) and to the practice of decision making. EJOR contains the following types of papers: • Invited Reviews, explaining to the general OR audience the developments in an OR topic over the recent years • Innovative Applications of OR, describing novel ways to solve real problems • Theory and Methodology Papers, presenting original research results contributing to the methodology of OR and to its theoretical foundations, • Short Communications, if they correct important errors found in papers previously published in EJOR

European Journal of Operational Research (EJOR) is :-

  • International, Peer-Reviewed, Open Access, Refereed, Applied Mathematics, Modelling, Simulation, Information Systems, Management, Statistics, Probability, Uncertainty, Management Science, Operations Research, Computer Science , Online or Print , Monthly Journal

  • UGC Approved, ISSN Approved: P-ISSN P-ISSN: 0377-2217, E-ISSN: 1872-6860, Established: 1977, Impact Factor: 6.0
  • Does Not Provide Crossref DOI

  • Not indexed in Scopus, WoS, DOAJ, PubMed, UGC CARE

Indexing

Publications of EJOR

An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows
Panos M. Pardalos September, 2024
The logistics companies executing the last mile delivery of goods in urban areas deal every day with the problem of routing their vehicles, while taking into account multiple trips per vehic...
CliSAT: A new exact algorithm for hard maximum clique problems
Panos M. Pardalos June, 2023
Given a graph, the maximum clique problem (MCP) asks for determining a complete subgraph with the largest possible number of vertices. We propose a new exact algorithm, called CliSAT, to sol...
A novel mixed integer programming model for freight train travel time estimation
Panos M. Pardalos July, 2022
Travel time estimation is a crucial problem in the field of transportation. While this problem has been extensively studied for over-the-road and air travel modes of transportation and resea...
A dual reformulation and solution framework for regularized convex clustering problems
Panos M. Pardalos May, 2021
Clustering techniques are powerful tools commonly used in statistical learning and data analytics. Most of the past research formulates clustering tasks as a non-convex problem, where a glob...