default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 67
Volume 67, Numbers 1-2, January 2017
- Panos M. Pardalos:
Preface. 1 - Fani Boukouvala
, M. M. Faruque Hasan, Christodoulos A. Floudas:
Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption. 3-42 - Juan P. Ruiz, Ignacio E. Grossmann:
Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques. 43-58 - Yash Puranik, Nikolaos V. Sahinidis:
Bounds tightening based on optimality conditions for nonconvex box-constrained optimization. 59-77 - Joan Davins-Valldaura, Saïd Moussaoui, Guillermo Pita Gil, Franck Plestan:
ParEGO extensions for multi-objective optimization of expensive evaluation functions. 79-96 - Paul Feliot, Julien Bect, Emmanuel Vázquez:
A Bayesian approach to constrained single- and multi-objective optimization. 97-133 - Yue Sun, Alfredo García:
Interactive model-based search with reactive resource allocation. 135-149 - Josef Kallrath:
Packing ellipsoids into volume-minimizing rectangular boxes. 151-185 - Alla R. Kammerdiner, Alexander Veremyev, Eduardo L. Pasiliao:
On Laplacian spectra of parametric families of closely connected networks with application to cooperative control. 187-205 - Lina Mallozzi, Antonia Passarelli di Napoli:
Optimal transport and a bilevel location-allocation problem. 207-221 - Dong Li, Anna Nagurney:
Supply chain performance assessment and supplier and component importance identification in a general competitive multitiered supply chain network model. 223-250 - Jun Pei, Xinbao Liu, Panos M. Pardalos, Athanasios Migdalas, Shanlin Yang:
Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine. 251-262 - Ingrida Steponavice, Rob J. Hyndman, Kate Smith-Miles, Laura Villanova:
Dynamic algorithm selection for pareto optimal set approximation. 263-282 - Ling Wang, Lu An, Jiaxing Pi, Minrui Fei, Panos M. Pardalos:
A diverse human learning optimization algorithm. 283-323 - Ximing Wang, Panos M. Pardalos:
A modified active set algorithm for transportation discrete network design bi-level problem. 325-342 - Yaohui Li, Yizhong Wu, Jianjun Zhao, Liping Chen:
A Kriging-based constrained global optimization algorithm for expensive black-box functions with infeasible initial points. 343-366 - Yicheng Xu, Dachuan Xu, Donglei Du, Chenchen Wu:
Local search algorithm for universal facility location problem with linear penalties. 367-378 - Mengyi Ying, Min Sun:
Some feasibility sampling procedures in interval methods for constrained global optimization. 379-397 - Haoxiang Jie, Yizhong Wu, Jianjun Zhao, Jianwan Ding, Liangliang:
An efficient multi-objective PSO algorithm assisted by Kriging metamodel for expensive black-box problems. 399-423 - Jonas Mockus, Remigijus Paulavicius, Dainius Rusakevicius, Dmitrij Sesok, Julius Zilinskas:
Application of Reduced-set Pareto-Lipschitzian Optimization to truss optimization. 425-450
Volume 67, Number 3, March 2017
- Dimitrios Nerantzis, Claire S. Adjiman:
Enclosure of all index-1 saddle points of general nonlinear functions. 451-474 - Cheng Lu, Zhibin Deng, Qingwei Jin:
An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints. 475-493 - Pengfei Zhang, Neng Fan:
Analysis of budget for interdiction on multicommodity network flows. 495-525 - Kaarthik Sundar, Sivakumar Rathinam:
Multiple depot ring star problem: a polyhedral study and an exact algorithm. 527-551 - Laleh Ravanbod, Dominikus Noll, Pierre Apkarian:
Branch and bound algorithm with applications to robust stability. 553-579 - Tobias Kuhn, Stefan Ruzika:
A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions. 581-600 - Daniel Vanderpooten, Lakmali Weerasena, Margaret M. Wiecek:
Covers and approximations in multiobjective optimization. 601-619 - Natashia Boland, Thomas Kalinowski, Fabian Rigterink:
A polynomially solvable case of the pooling problem. 621-630 - Akshay Gupte, Shabbir Ahmed, Santanu S. Dey, Myun-Seok Cheon:
Relaxations and discretizations for the pooling problem. 631-669 - Anna Martínez-Gavara, Vicente Campos, Manuel Laguna, Rafael Martí:
Heuristic solution approaches for the maximum minsum dispersion problem. 671-686
Volume 67, Number 4, April 2017
- Kamil A. Khan, Harry A. J. Watson, Paul I. Barton:
Differentiable McCormick relaxations. 687-729 - Ambros M. Gleixner, Timo Berthold, Benjamin Müller, Stefan Weltge:
Three enhancements for optimization-based bound tightening. 731-757 - Christoph Buchheim, Claudia D'Ambrosio:
Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization. 759-786 - José L. Sainz-Pardo, Javier Alcaraz, Mercedes Landete, Juan F. Monge:
On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem. 787-804 - Yuan Yuan, Zukui Li, Biao Huang:
Robust optimization approximation for joint chance constrained optimization problem. 805-827 - Nooshin Movahedian:
Bounded Lagrange multiplier rules for general nonsmooth problems and application to mathematical programs with equilibrium constraints. 829-850 - Qunfeng Liu, Guang Yang, Zhongzhi Zhang, Jinping Zeng:
Improving the convergence rate of the DIRECT global optimization algorithm. 851-872 - Dawei Zhan, Jiachang Qian, Yuansheng Cheng:
Balancing global and local search in parallel efficient global optimization algorithms. 873-892 - Spyridon Samothrakis, Maria Fasli, Diego Perez Liebana, Simon M. Lucas:
Default policies for global optimisation of noisy functions with severe noise. 893-907 - Abdo Y. Alfakih:
Universal rigidity of bar frameworks via the geometry of spectrahedra. 909-924
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-12-04 01:26 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:
