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
Claim Your Journal Get PRC Visit Website
e-ISSN 1573-2916
p-ISSN 0925-5001
Issue Frequency Monthly
Impact Factor 1.8
Est. Year 1991
Mobile 31786576000
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

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

Indexing

Publications of JGO

An Algorithm for Global Optimization using the Taylor–Bernstein Form as Inclusion Function
Ketan Kotecha December, 2002
We investigate the use of higher order inclusion functions in the Moore–Skelboe (MS) algorithm of interval analysis (IA) for unconstrained global optimization. We first propose an improvem...
On the complexity of quasiconvex integer minimization problem
Panos M. Pardalos April, 2019
In this paper, we consider the class of quasiconvex functions and its proper subclass of conic functions. The integer minimization problem of these functions is considered, assuming that the...
Preface to the special issue “ICVNS 2018”
Panos M. Pardalos August, 2020
The Variable Neighborhood Search (VNS) metaheuristic is based on systematic changes in the neighborhood structure within a search. It has been successfully applied for the solution of vario...
Parallel-batching scheduling with nonlinear processing times on a single and unrelated parallel machines
Panos M. Pardalos September, 2018
Parallel-batching processing and job deterioration are universal in the real industry. Scholars have deeply investigated the problem of parallel-batching scheduling and the problem of schedu...
Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterior...
Panos M. Pardalos December, 2020
This paper investigates a parallel-machine group scheduling problem where non-identical jobs with arbitrary sizes and inclusive processing set restrictions can be either processed on in-hous...
The lower bounded inverse optimal value problem on minimum spanning tree under unit l∞ norm
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, ...
Maximum shortest path interdiction problem by upgrading edges on trees under weighted l1 norm
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...
Copula theory approach to stochastic geometric programming
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...
Special Issue: 18th International conference on mathematical optimization theory and operations research (MOTOR 2019)
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...
Inverse max+sum spanning tree problem under weighted l∞ norm by modifying max-weight vector
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, ...