default search action
Journal of Global Optimization, Volume 41
Volume 41, Number 1, May 2008
- María J. Cánovas
, Abderrahim Hantoute, Marco A. López
Lipschitz behavior of convex semi-infinite optimization problems: a variational approach. 1-13 - Issam Dagher:
Quadratic kernel-free non-linear support vector machine. 15-30 - Elimhan N. Mahmudov
Sufficient conditions for optimality for differential inclusions of parabolic type and duality. 31-42 - Fabián Flores Bazán
Characterizing efficiency without linear structure: a unified approach. 43-60 - Teresa Alsinet
An efficient solver for weighted Max-SAT. 61-73 - Tin-Chi Lin, Dieter Vandenbussche:
Box-constrained quadratic programs with fixed charge variables. 75-102 - S. Nobakhtian:
Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints. 103-115 - Ya-Ping Fang, Nan-Jing Huang, Jen-Chih Yao:
Well-posedness of mixed variational inequalities, inclusion problems and fixed point problems. 117-133 - Bui Trong Kien, Jen-Chih Yao, Nguyen Dong Yen:
On the solution existence of pseudomonotone variational inequalities. 135-145 - Guolin Yu, Sanyang Liu:
Optimality for ( h, phi )-multiobjective programming involving generalized type-I functions. 147-161
Volume 41, Number 2, June 2008
- Ramkumar Karuppiah, Ignacio E. Grossmann:
A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures. 163-186 - Kenji Kimura, Jen-Chih Yao:
Sensitivity analysis of solution mappings of parametric vector quasi-equilibrium problems. 187-202 - Ke Su:
A globally and superlinearly convergent modified SQP-filter method. 203-217 - Takashi Okamoto, Eitaro Aiyoshi:
Global optimization using a synchronization of multiple search Points autonomously driven by a chaotic dynamic model. 219-244 - Oliver Stein, Aysun Tezel:
The semismooth approach for semi-infinite programming under the Reduction Ansatz. 245-266 - Yaodong Cui, Zhiyong Liu:
T-shape homogenous block patterns for the two-dimensional cutting problem. 267-281 - Mahbobeh Hosseinyazdi:
The optimization problem over a distributive lattice. 283-298 - Charles Audet, Vincent Béchard
Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search. 299-318
Volume 41, Number 3, July 2008
- Hubertus Th. Jongen, Oliver Stein:
Smoothing by mollifiers. Part I: semi-infinite optimization. 319-334 - Hubertus Th. Jongen, Oliver Stein:
Smoothing by mollifiers. Part II: nonlinear optimization. 335-350 - Le Dung Muu, V. H. Nguyen, N. V. Quy:
On Nash-Cournot oligopolistic market equilibrium models with concave cost functions. 351-364 - Lewis Ntaimo, Matthew W. Tanner:
Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs. 365-384 - Allan Frendrup, Michael A. Henning, Preben D. Vestergaard:
Total domination in partitioned trees and partitioned graphs with minimum degree two. 385-399 - Nan-Jing Huang, Jun Li, Soon-Yi Wu:
Gap functions for a system of generalized vector quasi-equilibrium problems with set-valued mappings. 401-415 - Min Li, Abdellah Bnouhachem
A modified inexact operator splitting method for monotone variational inequalities. 417-426 - Haiyan Lu, Weiqi Chen:
Self-adaptive velocity particle swarm optimization for solving constrained optimization problems. 427-445 - Kenneth Holmström:
An adaptive radial basis algorithm (ARBF) for expensive black-box global optimization. 447-464 - Lu-Chuan Zeng, Jen-Chih Yao:
Mixed projection methods for systems of variational inequalities. 465-478
Volume 41, Number 4, August 2008
- Kalyanmoy Deb:
Scope of stationary multi-objective evolutionary optimization: a case study on a hydro-thermal power dispatch problem. 479-515 - Daniel Gourion, Dinh The Luc:
Generating the weakly efficient set of nonconvex multiobjective problems. 517-538 - Lam Quoc Anh, Phan Quoc Khanh
Various kinds of semicontinuity and the solution sets of parametric multivalued symmetric vector quasiequilibrium problems. 539-558 - Oliver Schütze
Convergence of stochastic search algorithms to finite size pareto set approximations. 559-577 - Rúbia M. Oliveira, Paulo A. V. Ferreira:
A convex analysis approach for convex multiplicative programming. 579-592 - Peiping Shen, Yuan Ma, Yongqiang Chen:
A robust algorithm for generalized geometric programming. 593-612 - Miguel A. Goberna
On the stable containment of two sets. 613-624 - Radu Ioan Bot, Gert Wanka:
The conjugate of the pointwise maximum of two convex functions revisited. 625-632 - Ismail Serdar Bakal, Joseph Geunes, H. Edwin Romeijn:
Market selection decisions for inventory models with price-sensitive demand. 633-657
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-01-14 21:18 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: