default search action
Journal of Global Optimization, Volume 77
Volume 77, Number 1, May 2020
- Eligius M. T. Hendrix
, Leocadio G. Casado:
Preface: Special issue Europt 2018. 1-2 - Gabriele Eichfelder
An algorithmic approach to multiobjective optimization with decision uncertainty. 3-25 - Manuel Arana-Jiménez
On generating the set of nondominated solutions of a linear programming problem with parameterized fuzzy numbers. 27-52 - Tommaso Colombo
Distributed algorithms for convex problems with linear coupling constraints. 53-73 - Pavlo Muts
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming. 75-96 - Laura Palagi
Block layer decomposition schemes for training deep neural networks. 97-124 - Annamaria Barbagallo, Serena Guarino Lo Bianco:
On ill-posedness and stability of tensor variational inequalities: application to an economic equilibrium. 125-141 - Elisabetta Allevi, J. E. Martínez-Legaz
Optimality conditions for convex problems on intersections of non necessarily convex sets. 143-155 - Mikalojus Ramanauskas, Dmitrij Sesok
Global optimization of grillage-type foundations using a distributed genetic algorithm. 157-173 - Frank J. Kampas, János D. Pintér, Ignacio Castillo
Packing ovals in optimized regular polygons. 175-196
Volume 77, Number 2, June 2020
- Remigijus Paulavicius
New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm. 197-225 - Santanu S. Dey
Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem. 227-272 - Nithirat Sisarat, Rabian Wangkeeree
Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps. 273-287 - Jerzy Grzybowski
Order cancellation law in the family of bounded convex sets. 289-300 - Yong Xia
Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds. 301-318 - Xianyue Li, Zhao Zhang, Ruowang Yang, Heping Zhang, Ding-Zhu Du:
Approximation algorithms for capacitated partial inverse maximum spanning tree problem. 319-340 - Justo Puerto
An exact completely positive programming formulation for the discrete ordered median problem: an extended version. 341-359 - Md Sarowar Morshed
Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem. 361-382 - Francisco J. Aragón Artacho
An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm. 383-403 - Nguyen Van Luong, Qamrul Hasan Ansari
Linear conditioning, weak sharpness and finite convergence for equilibrium problems. 405-424
Volume 77, Number 3, July 2020
- Yi Zhang
Optimality-based domain reduction for inequality-constrained NLP and MINLP problems. 425-454 - Bjarne A. Grimstad
Mathematical programming formulations for piecewise polynomial functions. 455-486 - Ishan Bajaj, M. M. Faruque Hasan
Global dynamic optimization using edge-concave underestimator. 487-512 - Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh:
Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures. 513-541 - Young Woong Park
Subset selection for multiple linear regression via optimization. 543-574 - Ge Yu
Primal-dual analysis for online interval scheduling problems. 575-602 - Yifu Chen, Christos T. Maravelias
Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization. 603-625 - Nader Kanzi
Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization. 627-641 - Márcio Antônio de Andrade Bortoloti
Damped Newton's method on Riemannian manifolds. 643-660 - M. Farrokhiniya, Ali Barani:
Limiting Subdifferential Calculus and Perturbed Distance Function in Riemannian Manifolds. 661-685
Volume 77, Number 4, August 2020
- Francisco Jara-Moroni
An enhanced logical benders approach for linear programs with complementarity constraints. 687-714 - Pascal Halffmann
An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem. 715-742 - Ryan Alimo
Delaunay-based derivative-free optimization via global surrogates. Part III: nonconvex constraints. 743-776 - M. Joseane F. G. Macêdo
Filter-based stochastic algorithm for global optimization. 777-805 - Vu Trung Hieu
Solution maps of polynomial variational inequalities. 807-824 - Zhiping Chen
A sparse chance constrained portfolio selection model with multiple constraints. 825-852 - Marc C. Robini, Feng Yang, Yuemin Zhu:
A stochastic approach to full inverse treatment planning for charged-particle therapy. 853-893 - Rui Chen, Hai Jiang
Capacitated assortment and price optimization under the nested logit model. 895-918 - Ray-Bing Chen
Finding optimal points for expensive functions using adaptive RBF-based surrogate model via uncertainty quantification. 919-948 - Bruno Q. Pinto, Celso C. Ribeiro
A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model. 949-973
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 2024-12-22 19: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: