![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Journal of Global Optimization, Volume 37
Volume 37, Number 1, January 2007
- T. N. Hoa, N. Q. Huy, T. D. Phuong, Nguyen Dong Yen:
Unbounded Components in the Solution Sets of Strictly Quasiconcave Vector Maximization Problems. 1-10 - Hark-Chin Hwang:
An Efficient Procedure for Dynamic Lot-sizing Model with Demand Time Windows. 11-26 - X. Yang, Min Sun:
Theoretical Convergence Analysis of a General Division-deletion Algorithm for Solving Global Search Problems. 27-45 - Hanif D. Sherali, Vikram Ganesan:
An Inverse Reliability-based Approach for Designing under Uncertainty with Application to Robust Piston Design. 47-62 - Xie Ping Ding:
Nonempty Intersection Theorems and Generalized Multi-objective Games in Product FC-Spaces. 63-73 - Etienne de Klerk, Dmitrii V. Pasechnik
:
A linear programming reformulation of the standard quadratic optimization problem. 75-84 - Wu Li, Jiming Peng:
Exact Penalty Functions for Constrained Minimization Problems via Regularized Gap Function for Variational Inequalities. 85-94 - Etsuji Tomita, Toshikatsu Kameda:
An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments. 95-111 - Rommel G. Regis
, Christine A. Shoemaker
:
Improved Strategies for Radial basis Function Methods for Global Optimization. 113-135 - Dirk P. Kroese
, Reuven Y. Rubinstein, Thomas Taimre
:
Application of the cross-entropy method to clustering and vector quantization. 137-157
Volume 37, Number 2, February 2007
- William Baritompa, David W. Bulger
, Graham R. Wood:
Generating functions and the performance of backtracking adaptive search. 159-175 - Chandra Sekhar Pedamallu, Linet Özdamar
, Tibor Csendes:
Symbolic Interval Inference Approach for Subdivision Direction Selection in Interval Partitioning Algorithms. 177-194 - Lai-Jiu Lin, Huai-Wen Hsu:
Existences theorems of systems of vector quasi-equillibrium problems and mathematical programs with equilibrium constraint. 195-213 - Pierre Hansen, Jean-Louis Lagouanelle, Frédéric Messine:
Comparison Between Baumann and Admissible Simplex Forms in Interval Analysis. 215-228 - Fabián Flores Bazán, Nicolas Hadjisavvas
, Cristian Vera:
An Optimal Alternative Theorem and Applications to Mathematical Programming. 229-243 - Roberto Livrea, Giovanni Molica Bisci
:
Some remarks on nonsmooth critical point theory. 245-261 - Paolo Cubiotti, Jen-Chih Yao:
Discontinuous implicit generalized quasi-variational inequalities in Banach spaces. 263-274 - Lai-Jiu Lin:
Mathematical Programming with System of Equilibrium Constraints. 275-286 - X. X. Huang, X. Q. Yang:
Levitin-Polyak well-posedness of constrained vector optimization problems. 287-304 - Zvi Drezner:
A General Global Optimization Approach for Solving Location Problems in the Plane. 305-319 - Hoang Tuy:
On duality bound methods for nonconvex global optimization. 321-323
Volume 37, Number 3, March 2007
- Kathrin Klamroth
, Jørgen Tind:
Constrained optimization using multiple objective programming. 325-355 - Chi-Kong Ng, Duan Li
, Lian-Sheng Zhang:
Discrete global descent method for discrete global optimization and nonlinear integer programming. 357-379 - Luis Moreno
, Santiago Garrido
, Dolores Blanco:
Mobile Robot Global Localization using an Evolutionary MAP Filter. 381-403 - Heikki Maaranen, Kaisa Miettinen
, Antti Penttinen:
On initial populations of a genetic algorithm for continuous optimization problems. 405-436 - Cristian Vladimirescu
:
Existence results for inequality problems on various subsets of Banach spaces and applications. 437-447 - Lam Quoc Anh, Phan Quoc Khanh
:
Uniqueness and Hölder continuity of the solution to multivalued equilibrium problems in metric spaces. 449-465 - Eduardo Conde
:
A Branch and Bound algorithm for the minimax regret spanning arborescence. 467-480 - Jose A. Egea
, Maria Rodriguez-Fernandez
, Julio R. Banga
, Rafael Martí
:
Scatter search for chemical and bio-process optimization. 481-503
Volume 37, Number 4, April 2007
- Po-Chung Yang, Hui-Ming Wee, H. J. Yang:
Global optimal policy for vendor-buyer integrated inventory system within just in time environment. 505-511 - François-Xavier Jollois, Mohamed Nadif:
Speed-up for the expectation-maximization algorithm for clustering categorical data. 513-525 - Pilar Martínez Ortigosa
, Juana López Redondo
, Inmaculada García
, José-Jesús Fernández:
A population global optimization algorithm to solve the image alignment problem in electron crystallography. 527-539 - Frédéric Dambreville:
Cross-entropic learning of a machine for the decision in a partially observable universe. 541-555 - Hoang Tuy, N. T. Hoai-Phuong:
A robust algorithm for quadratic optimization under quadratic constraints. 557-569 - Omar Boussaid, Adrian Tanasescu, Fadila Bentayeb, Jérôme Darmont
:
Integration and dimensional modeling approaches for complex data warehousing. 571-591 - Le Thi Hoai An
, M. Tayeb Belghiti, Pham Dinh Tao:
A new efficient algorithm based on DC programming and DCA for clustering. 593-608 - Akoa François, Hachemi Abdelkader, Le Thi Hoai An
, Mouhtamid Said, Pham Dinh Tao:
Application of lower bound direct method to engineering structures. 609-630 - Guo-xin Liu:
A homotopy interior point method for semi-infinite programming problems. 631-646 - Shengjie Li, Kok Lay Teo, Xiaoqi Yang
:
Vector equilibrium problems with elastic demands and capacity constraints. 647-660 - Di Wu, Zhijun Wu:
An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data. 661-673
![](https://dblp.org/img/cog.dark.24x24.png)
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.