Back to Top
Go Back
Journal Photo for Journal of Global Optimization
Peer reviewed only Open Access

Journal of Global Optimization (JGO)

Publisher : Springer Nature -Verlag
Optimization Mathematics Applied Mathematics
e-ISSN 1573-2916
p-ISSN 0925-5001
Issue Frequency Monthly
Impact Factor 1.8
Est. Year 1991
Mobile 31786576000
Country Netherlands The
Language English
APC YES
Impact Factor Assignee Google Scholar
Email Claudia.Acuna@Springer.com

Journal Descriptions

The Journal of Global Optimization publishes carefully refereed papers that encompass theoretical, computational, and applied aspects of global optimization. While the focus is on original research contributions dealing with the search for global optima of non-convex, multi-extremal problems, the journal’s scope covers optimization in the widest sense, including nonlinear, mixed integer, combinatorial, stochastic, robust, multi-objective optimization, computational geometry, and equilibrium problems. Relevant works on data-driven methods and optimization-based data mining are of special interest. In addition to papers covering theory and algorithms of global optimization, the journal publishes significant papers on numerical experiments, new testbeds, and applications in engineering, management, and the sciences. Applications of particular interest include healthcare, computational biochemistry, energy systems, telecommunications, and finance. Apart from full-length articles, the journal features short communications on both open and solved global optimization problems. It also offers reviews of relevant books and publishes special issues.

Journal of Global Optimization (JGO) is :-

  • International, Peer-Reviewed, Open Access, Refereed, Optimization, Mathematics, Applied Mathematics, Management , Online or Print , Monthly Journal

  • UGC Approved, ISSN Approved: P-ISSN P-ISSN: 0925-5001, E-ISSN: 1573-2916, Established: 1991, Impact Factor: 1.8
  • Does Not Provide Crossref DOI
  • Indexed in: Scopus, WoS

  • Not indexed in DOAJ, PubMed, UGC CARE

Indexing

Publications of JGO

Panos M. Pardalos March, 2024
Algorithm portfolios are multi-algorithmic schemes that combine a number of solvers into a joint framework for solving global optimization problems. A crucial part of such schemes is the res...
Panos M. Pardalos May, 2022
Many papers in the field of integer linear programming (ILP, for short) are devoted to problems of the type max{c ⊤x: Ax = b, x ∈ Z n ≥0}, where all the entries of A, b, c are intege...
Panos M. Pardalos May, 2023
We consider the restricted inverse optimal value problem on shortest path under weighted l1 norm on trees (RIOVSPT1). It aims at adjusting some edge weights to minimize the total cost under ...
Panos M. Pardalos July, 2023
In view of some shortcomings of traditional vertex 1-center (V1C), we introduce a vertex quickest 1-center (VQ1C) problem on a tree, which aims to find a vertex such that the maximum transmi...
Panos M. Pardalos May, 2022
The max+sum spanning tree (MSST) problem is to determine a spanning tree T whose combined weight maxeeт w(e) + Σeer c(e) is minimum for a given edge-weighted undirected network G(V, E, c, ...
Panos M. Pardalos May, 2022
We’re sorry, something doesn't seem to be working properly. Please try refreshing the page. If that doesn't work, please contact support so we can address the problem. This special i...
Panos M. Pardalos July, 2021
In this research, stochastic geometric programming with joint chance constraints is investigated with elliptically distributed random parameters. The constraint’s random coefficient vector...
Panos M. Pardalos October, 2020
Network interdiction problems by deleting critical edges have wide applicatio ns. However, in some practical applications, the goal of deleting edges is difficult to achieve. We consider t...
Panos M. Pardalos September, 2020
We consider the lower bounded inverse optimal value problem on minimum spanning tree under unit l∞ norm. Given an edge weighted connected undirected network G=(V,E,w), a spanning tree T0, ...