default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 71
Volume 71, Number 1, May 2018
- Renato De Leone
, Yaroslav D. Sergeyev, Anatoly Zhigljavsky:
Guest editors' preface to the special issue devoted to the 2nd International Conference "Numerical Computations: Theory and Algorithms", June 19-25, 2016, Pizzo Calabro, Italy. 1-4 - Remigijus Paulavicius, Lakhdar Chiter, Julius Zilinskas:
Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants. 5-20 - Konstantin Barkalov, Roman G. Strongin:
Solving a set of global optimization problems by the parallel technique with uniform convergence. 21-36 - Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico, Adil M. Bagirov:
Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations. 37-55 - Andrey Pepelyshev, Anatoly Zhigljavsky, Antanas Zilinskas:
Performance of global random search algorithms for large dimensions. 57-71 - Victor Gergel, Evgeny Kozinov:
Efficient multicriterial optimization based on intensive reuse of search information. 73-90 - M. Hosein Zare, Osman Y. Özaltin, Oleg A. Prokopyev:
On a class of bilevel linear mixed-integer programs in adversarial settings. 91-113 - Albertas Gimbutas, Antanas Zilinskas:
An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section. 115-127 - Yuri Evtushenko, Mikhail Posypkin, Larisa Rybak, Andrei Turkin:
Approximating a solution set of nonlinear inequalities. 129-145 - Wenjuan Fan, Jun Pei, Xinbao Liu, Panos M. Pardalos, Min Kong:
Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning. 147-163 - James M. Calvin, Grazina Gimbutiene, William O. Phillips, Antanas Zilinskas:
On convergence rate of a rectangular partition based global optimization algorithm. 165-191 - Daniela Lera, Yaroslav D. Sergeyev:
GOSH: derivative-free global optimization using multi-dimensional space-filling curves. 193-211 - Antonio Candelieri, Raffaele Perego, Francesco Archetti:
Bayesian optimization of pump operations in water distribution systems. 213-235
Volume 71, Number 2, June 2018
- Maxim V. Dolgopolik:
Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property. 237-296 - Takahito Kuno:
A modified simplicial algorithm for convex maximization based on an extension of ω-subdivision. 297-311 - Shinji Yamada, Akiko Takeda:
Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization. 313-339 - Qiao-Li Dong, Y. C. Tang, Y. J. Cho, Themistocles M. Rassias:
"Optimal" choice of the step length of the projection and contraction methods for solving the split feasibility problem. 341-360 - Shengguan Xu, Hong-Quan Chen:
Nash game based efficient global optimization for large-scale design problems. 361-381 - Shokouh Shahbeyk, Majid Soleimani-Damaneh, Refail Kasimbeyli:
Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure. 383-405 - Eric Bradford, Artur M. Schweidtmann, Alexei A. Lapkin:
Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm. 407-438 - Eric Bradford, Artur M. Schweidtmann, Alexei A. Lapkin:
Correction to: Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm. 439-440
Volume 71, Number 3, July 2018
- Ana Maria A. C. Rocha, M. Fernanda P. Costa, Edite M. G. P. Fernandes:
Preface to the Special Issue "GOW'16". 441-442 - Milan Hladík:
Testing pseudoconvexity via interval computation. 443-455 - Marcia Fampa, Francisco Pinillos Nieto:
Extensions on ellipsoid bounds for quadratic integer programming. 457-482 - Ignacio Araya, Bertrand Neveu:
lsmear: a variable selection strategy for interval branch and bound solvers. 483-500 - Sonia Cafieri, Claudia D'Ambrosio:
Feasibility pump for aircraft deconfliction with speed regulation. 501-515 - M. Fernanda P. Costa, Ana Maria A. C. Rocha, Edite M. G. P. Fernandes:
Filter-based DIRECT method for constrained global optimization. 517-536 - Angelo Lucia, Peter A. DiMaggio, Diego Alonso-Martinez:
Metabolic pathway analysis using a nash equilibrium approach. 537-550 - Immanuel M. Bomze, Vaithilingam Jeyakumar, Guoyin Li:
Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations. 551-569 - Jan Kronqvist, Andreas Lundell, Tapio Westerlund:
Reformulations for utilizing separability when solving convex MINLP problems. 571-592 - Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp:
Integrality gap minimization heuristics for binary mixed integer nonlinear programming. 593-612 - Daniel Aloise, Claudio Contardo:
A sampling-based exact algorithm for the solution of the minimax diameter clustering problem. 613-630 - Juan José Moreno, Gloria Ortega López, Ernestas Filatovas, José Antonio Martínez, Ester M. Garzón:
Improving the performance and energy of Non-Dominated Sorting for evolutionary multiobjective optimization on GPU/CPU platforms. 631-649
Volume 71, Number 4, August 2018
- Efstratios N. Pistikopoulos:
In memoriam: Professor Christodoulos A. Floudas (1959-2016). 651-653 - Radu Baltean-Lugojan, Ruth Misener:
Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness. 655-690 - Pedro A. Castillo-Castillo, Pedro M. Castro, Vladimir Mahalec:
Global optimization of MIQCPs with dynamic piecewise relaxations. 691-716 - Felipe Fidalgo, Douglas Soares Gonçalves, Carlile Lavor, Leo Liberti, Antonio Mucherino:
A symmetry-based splitting strategy for discretizable distance geometry problems. 717-733 - M. M. Faruque Hasan:
An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems. 735-752 - Rohit Kannan, Paul I. Barton:
Convergence-order analysis of branch-and-bound algorithms for constrained problems. 753-813 - Nikolaos Kazazakis, Claire S. Adjiman:
Arbitrarily tight α BB underestimators of general non-linear functions over sub-optimal domains. 815-844 - Chris A. Kieslich, Fani Boukouvala, Christodoulos A. Floudas:
Optimization of black-box problems using Smolyak grids and polynomial approximations. 845-869 - Cristiana L. Lara, Francisco Trespalacios, Ignacio E. Grossmann:
Global optimization algorithm for capacitated multi-facility continuous location-allocation problems. 871-889 - Alexander Mitsos, Jaromil Najman, Ioannis G. Kevrekidis:
Optimal deterministic algorithm generation. 891-913 - Tiago Montanher, Arnold Neumaier, Ferenc Domes:
A computational study of global optimization solvers on two trust region subproblems. 915-934 - Akang Wang, Christopher L. Hanselman, Chrysanthos E. Gounaris:
A customized branch-and-bound approach for irregular shape nesting. 935-955 - Zilong Wang, Marianthi Ierapetritou:
Surrogate-based feasibility analysis for black-box stochastic simulations with heteroscedastic noise. 957-985 - Tapio Westerlund, Ville-Pekka Eronen, Marko M. Mäkelä:
On solving generalized convex MINLP problems using supporting hyperplane techniques. 987-1011
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-21 01:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
