Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 26 matches
- 2003
- Le Thi Hoai An:
Solving Large Scale Molecular Distance Geometry Problems by a Smoothing Technique via the Gaussian Transform and D.C. Programming. J. Glob. Optim. 27(4): 375-397 (2003) - Tadeusz Antczak:
A New Approach to Multiobjective Programming with a Modified Objective Function. J. Glob. Optim. 27(4): 485-495 (2003) - Derek E. Armstrong, Sheldon H. Jacobson:
Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems. J. Glob. Optim. 27(1): 83-96 (2003) - Adil M. Bagirov, Alexander M. Rubinov:
Cutting Angle Method and a Local Search. J. Glob. Optim. 27(2-3): 193-213 (2003) - Peter Brucker, Johann L. Hurink, Thomas Rolfes:
Routing of Railway Carriages. J. Glob. Optim. 27(2-3): 313-332 (2003) - Louis Caccetta, Stephen P. Hill:
An Application of Branch and Cut to Open Pit Mine Scheduling. J. Glob. Optim. 27(2-3): 349-365 (2003) - T. C. Edwin Cheng, Natalia V. Shakhlevich:
Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates. J. Glob. Optim. 27(2-3): 293-311 (2003) - Hui-Yuan Fan, Jouni Lampinen:
A Trigonometric Mutation Operation to Differential Evolution. J. Glob. Optim. 27(1): 105-129 (2003) - Haitao Fang, Han-Fu Chen:
Blind Channel Identification Based on Noisy Observation by Stochastic Approximation Method. J. Glob. Optim. 27(2-3): 249-271 (2003) - Bernard Hanzon, Dorina Jibetean:
Global Minimization of a Multivariate Polynomial using Matrix Methods. J. Glob. Optim. 27(1): 1-23 (2003) - Uwe Helmke, Knut Hüper, John B. Moore:
Computation of Signature Symmetric Balanced Realizations. J. Glob. Optim. 27(2-3): 135-148 (2003) - Hubertus Th. Jongen, Oliver Stein:
On the Complexity of Equalizing Inequalities. J. Glob. Optim. 27(4): 367-374 (2003) - Wieslaw Kubiak:
Cyclic Just-In-Time Sequences Are Optimal. J. Glob. Optim. 27(2-3): 333-347 (2003) - Xun Li, Xun Yu Zhou, Mustapha Ait Rami:
Indefinite Stochastic Linear Quadratic Control with Markovian Jumps in Infinite Time Horizon. J. Glob. Optim. 27(2-3): 149-175 (2003) - Zhian Liang, Hong-Xuan Huang, Panos M. Pardalos:
Efficiency Conditions and Duality for a Class of Multiobjective Fractional Programming Problems. J. Glob. Optim. 27(4): 447-471 (2003) - Giandomenico Mastroeni:
Gap Functions for Equilibrium Problems. J. Glob. Optim. 27(4): 411-426 (2003) - Alistair I. Mees, Cameron Tovey:
Constraint Selection and Deterministic Annealing. J. Glob. Optim. 27(2-3): 233-247 (2003) - Kaisa Miettinen, Marko M. Mäkelä, Jari Toivanen:
Numerical Comparison of Some Penalty-Based Constraint Handling Techniques in Genetic Algorithms. J. Glob. Optim. 27(4): 427-446 (2003) - Jairo R. Montoya-Torres:
Competitive Analysis of a Better On-line Algorithm to Minimize Total Completion Time on a Single-machine. J. Glob. Optim. 27(1): 97-103 (2003) - Liqun Qi, Soon-Yi Wu, Guanglu Zhou:
Semismooth Newton Methods for Solving Semi-Infinite Programming Problems. J. Glob. Optim. 27(2-3): 215-232 (2003) - Pham Huu Sach, Gue Myung Lee, Do Sang Kim:
Infine Functions, Nonsmooth Alternative Theorems and Vector Optimization Problems. J. Glob. Optim. 27(1): 51-81 (2003) - Roman G. Strongin, Yaroslav D. Sergeyev:
Global Optimization: Fractal Approach and Non-redundant Parallelism. J. Glob. Optim. 27(1): 25-50 (2003) - George L. Vairaktarakis, Xiaoqiang Cai:
Complexity of Workforce Scheduling in Transfer Lines. J. Glob. Optim. 27(2-3): 273-291 (2003) - Song Wang, Les S. Jennings, Kok Lay Teo:
Numerical Solution of Hamilton-Jacobi-Bellman Equations by an Upwind Finite Volume Method. J. Glob. Optim. 27(2-3): 177-192 (2003) - Changyu Wang, X. Q. Yang, Xinmin Yang:
Nonlinear Lagrange Duality Theorems and Penalty Function Methods In Continuous Optimization. J. Glob. Optim. 27(4): 473-484 (2003) - Dachuan Xu, Jiye Han, Zheng-Hai Huang, Liping Zhang:
Improved Approximation Algorithms for MAX \fracn\text2-DIRECTED-BISECTION and MAX \fracn\text2-DENSE-SUBGRAPH. J. Glob. Optim. 27(4): 399-410 (2003)
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-14 02:40 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint