Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 48
Volume 48, Number 1, September 2010
- Panos M. Pardalos, Yaroslav D. Sergeyev
:
Foreword: Special issue celebrating the 70th birthday of Roman G. Strongin. 1-2 - Valerian Bulatov:
Methods of embedding-cutting off in problems of mathematical programming. 3-15 - James M. Calvin:
A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise. 17-27 - Veronika V. Demyanova, Vladimir F. Demyanov:
One-dimensional identification problem and ranking parameters. 29-40 - Daniela di Serafino, Susana Gómez, Leopoldo Milano, Filippo Riccio, Gerardo Toraldo:
A genetic algorithm for a global optimization problem arising in the detection of gravitational waves. 41-55 - Neng Fan, Panos M. Pardalos:
Linear and quadratic programming approaches for the general graph partitioning problem. 57-71 - Marco Gaviano, Daniela Lera, A. M. Steri:
A local search method for continuous global optimization. 73-85 - Anatoly A. Zhigljavsky, Emily Hamilton:
Stopping rules in k-adaptive global random search algorithms. 87-97 - Daniela Lera, Yaroslav D. Sergeyev:
An information global minimization algorithm using the local improvement technique. 99-112 - Giampaolo Liuzzi, Stefano Lucidi, Veronica Piccialli:
A partition-based global optimization algorithm. 113-128 - Jonas Mockus:
On simulation of optimal strategies and Nash equilibrium in the financial market context. 129-143 - Valeria Ruggiero, Thomas Serafini, Riccardo Zanella, Luca Zanni:
Iterative regularization algorithms for constrained image deblurring on graphics processors. 145-157 - Alexander S. Strekalovsky, Andrey V. Orlov, Anton V. Malyshev:
On computational search for optimistic solutions in bilevel problems. 159-172 - Antanas Zilinskas:
On similarities between two models of global optimization: statistical models and radial basis functions. 173-182
Volume 48, Number 2, October 2010
- Nguyen Dinh, Jean-Jacques Strodiot, Van Hien Nguyen:
Duality and optimality conditions for generalized equilibrium problems involving DC functions. 183-208 - Rafael Blanquero, Emilio Carrizosa:
On the norm of a dc function. 209-213 - Süreyya Özögür-Akyüz, Gerhard-Wilhelm Weber:
On numerical optimization theory of infinite kernel learning. 215-239 - Changfeng Ma:
A new smoothing and regularization Newton method for P0-NCP. 241-261 - Shivaram Subramanian, Hanif D. Sherali:
A fractional programming approach for retail category price optimization. 263-277 - Giovanni Anello, Maria Bernadette Donato, Monica Milasi:
A quasi-variational approach to a competitive economic equilibrium problem without strong monotonicity assumption. 279-287 - Ernesto G. Birgin, Erico M. Gozzi, Mauricio G. C. Resende, Ricardo M. A. Silva:
Continuous GRASP with a local active-set method for bound-constrained global optimization. 289-310 - Tuomo Valkonen:
Refined optimality conditions for differences of convex functions. 311-321 - Dimitris Bertsimas, Omid Nohadani:
Robust optimization with simulated annealing. 323-334 - Zhe Liang, Wanpracha Art Chaovalitwongse:
Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models. 335-345
Volume 48, Number 3, November 2010
- Emilio Fortunato Campana, Giovanni Fasano, Antonio Pinto:
Dynamic analysis for the selection of parameters and initial population, in particle swarm optimization. 347-397 - Angela Vincenti, Mohammad Reza Ahmadian, Paolo Vannucci:
BIANCA: a genetic algorithm to solve hard combinatorial optimisation problems in engineering. 399-421 - Xiaolong Qin, Sun Young Cho, Shin Min Kang:
Iterative algorithms for variational inequality and equilibrium problems with applications. 423-445 - Janez Povh:
Semidefinite approximations for quadratic programs over orthogonal matrices. 447-463 - Zhi Liu, Yiran He:
Exceptional family of elements for generalized variational inequalities. 465-471 - Anita Schöbel, Daniel Scholz:
The theoretical and empirical rate of convergence for geometric branch-and-bound methods. 473-495 - Cheng Lu, Zhenbo Wang, Wenxun Xing:
An improved lower bound and approximation algorithm for binary constrained quadratic programming problem. 497-508 - Fatos Xhafa:
A. Mucherino, P. J. Papajorgji, P. M. Pardalos: Data mining in agriculture - Springer-Verlag, 2009, ISBN: 978-0-387-88614-5. 509-510
Volume 48, Number 4, December 2010
- Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Per-Magnus Olsson:
Optimal placement of UV-based communications relay nodes. 511-531 - Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich:
A heuristic method for the minimum toll booth problem. 533-548 - Polyxeni-Margarita Kleniati, Panos Parpas, Berç Rustem:
Partitioning procedure for polynomial optimization. 549-567 - Özgür Özpeynirci, Murat Köksalan:
Pyramidal tours and multiple objectives. 569-582 - Dominique Fortin, Ider Tseveendorj:
Piece adding technique for convex maximization problems. 583-593 - Pham Dinh Tao, Nam Nguyen Canh, Le Thi Hoai An:
An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs. 595-632 - Xu Zhu, Jieun Yu, Wonjun Lee, Donghyun Kim, Shan Shan, Ding-Zhu Du:
New dominating sets in social networks. 633-642 - Yonghong Yao, Yeong-Cheng Liou, Shin Min Kang:
Minimization of equilibrium problems, variational inequality problems and fixed point problems. 643-656 - Annabella Astorino, Antonio Fuduli, Manlio Gaudioso:
DC models for spherical separation. 657-669
a service of 
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-04-18 20:20 CEST 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:
