default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 27
Volume 27, Number 1, September 2003
- Bernard Hanzon, Dorina Jibetean:
Global Minimization of a Multivariate Polynomial using Matrix Methods. 1-23 - Roman G. Strongin
, Yaroslav D. Sergeyev:
Global Optimization: Fractal Approach and Non-redundant Parallelism. 25-50 - Pham Huu Sach, Gue Myung Lee, Do Sang Kim:
Infine Functions, Nonsmooth Alternative Theorems and Vector Optimization Problems. 51-81 - Derek E. Armstrong, Sheldon H. Jacobson:
Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems. 83-96 - Jairo R. Montoya-Torres:
Competitive Analysis of a Better On-line Algorithm to Minimize Total Completion Time on a Single-machine. 97-103 - Hui-Yuan Fan, Jouni Lampinen:
A Trigonometric Mutation Operation to Differential Evolution. 105-129
Volume 27, Numbers 2-3, November 2003
- Uwe Helmke, Knut Hüper, John B. Moore:
Computation of Signature Symmetric Balanced Realizations. 135-148 - Xun Li, Xun Yu Zhou, Mustapha Ait Rami:
Indefinite Stochastic Linear Quadratic Control with Markovian Jumps in Infinite Time Horizon. 149-175 - Song Wang, Les S. Jennings, Kok Lay Teo:
Numerical Solution of Hamilton-Jacobi-Bellman Equations by an Upwind Finite Volume Method. 177-192 - Adil M. Bagirov, Alexander M. Rubinov:
Cutting Angle Method and a Local Search. 193-213 - Liqun Qi, Soon-Yi Wu, Guanglu Zhou:
Semismooth Newton Methods for Solving Semi-Infinite Programming Problems. 215-232 - Alistair I. Mees, Cameron Tovey:
Constraint Selection and Deterministic Annealing. 233-247 - Haitao Fang, Han-Fu Chen:
Blind Channel Identification Based on Noisy Observation by Stochastic Approximation Method. 249-271 - George L. Vairaktarakis, Xiaoqiang Cai:
Complexity of Workforce Scheduling in Transfer Lines. 273-291 - T. C. Edwin Cheng, Natalia V. Shakhlevich:
Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates. 293-311 - Peter Brucker, Johann L. Hurink, Thomas Rolfes:
Routing of Railway Carriages. 313-332 - Wieslaw Kubiak:
Cyclic Just-In-Time Sequences Are Optimal. 333-347 - Louis Caccetta, Stephen P. Hill:
An Application of Branch and Cut to Open Pit Mine Scheduling. 349-365
Volume 27, Number 4, December 2003
- Hubertus Th. Jongen, Oliver Stein:
On the Complexity of Equalizing Inequalities. 367-374 - Le Thi Hoai An:
Solving Large Scale Molecular Distance Geometry Problems by a Smoothing Technique via the Gaussian Transform and D.C. Programming. 375-397 - Dachuan Xu, Jiye Han, Zheng-Hai Huang, Liping Zhang:
Improved Approximation Algorithms for MAX \fracn\text2-DIRECTED-BISECTION and MAX \fracn\text2-DENSE-SUBGRAPH. 399-410 - Giandomenico Mastroeni:
Gap Functions for Equilibrium Problems. 411-426 - Kaisa Miettinen, Marko M. Mäkelä, Jari Toivanen:
Numerical Comparison of Some Penalty-Based Constraint Handling Techniques in Genetic Algorithms. 427-446 - Zhian Liang, Hong-Xuan Huang, Panos M. Pardalos:
Efficiency Conditions and Duality for a Class of Multiobjective Fractional Programming Problems. 447-471 - Changyu Wang, X. Q. Yang, Xinmin Yang:
Nonlinear Lagrange Duality Theorems and Penalty Function Methods In Continuous Optimization. 473-484 - Tadeusz Antczak:
A New Approach to Multiobjective Programming with a Modified Objective Function. 485-495
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 22:08 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:
