Springer Nature -Verlag
+1
1573-2916
Monthly
1.8
0925-5001
1991
31786576000
Netherlands The
English
YES
Google Scholar
Claudia.Acuna@Springer.com
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.
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...
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...
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 ...
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...
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, ...
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...
In this research, stochastic geometric programming with joint chance constraints is investigated with elliptically distributed random parameters. The constraint’s random coefficient vector...
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...
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, ...
OJSCloud offers a complete, free setup to get you publishing.
Start Your Free Journal!Scholar9.com is a peer-review platform that hosts journals from across the globe. Please note that we do not own any of the journals hosted on the platform.
Our platform enables journal owners to send articles for peer review to users who have registered via https://scholar9.com/register and have consented to serve as reviewers for multiple journals. Additionally, we offer an indirect manuscript submission system for journals that are claimed and actively managed by their respective owners on Scholar9.com.
For accurate information about the indexing status of journals (in databases such as UGC CARE, Scopus, or Web of Science) and contact details, users must refer to the respective official websites.
Scholar9 is not responsible for indexing claims, manuscript acceptance/rejection, refunds of article processing charges, or any stage of the final publication process. Users are strongly advised to verify all information provided on the platform independently.
Scholar9.com disclaims liability for disputes related to indexing claims, publication decisions, or other journal-specific matters. Users are encouraged to contact the respective journal owners directly for detailed information and clarifications.