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 27 matches
- 2000
- Brahim Aghezzaf, Mohamed Hachimi:
Generalized Invexity and Duality in Multiobjective Programming Problems. J. Glob. Optim. 18(1): 91-101 (2000) - Rafael Blanquero, Emilio Carrizosa:
On Covering Methods for D.C. Optimization. J. Glob. Optim. 18(3): 265-274 (2000) - E. P. J. Boer, Eligius M. T. Hendrix:
Global Optimization Problems in Optimal Design of Experiments in Regression Models. J. Glob. Optim. 18(4): 385-398 (2000) - Immanuel M. Bomze, Mirjam Dür, Etienne de Klerk, Cornelis Roos, Arie J. Quist, Tamás Terlaky:
On Copositive Programming and Standard Quadratic Optimization Problems. J. Glob. Optim. 18(4): 301-320 (2000) - Emilio Carrizosa, Horst W. Hamacher, Rolf Klein, Stefan Nickel:
Solving Nonconvex Planar Location Problems by Finite Dominating Sets. J. Glob. Optim. 18(2): 195-210 (2000) - Emilio Carrizosa, Frank Plastria:
Dominators for Multiple-objective Quasiconvex Maximization Problems. J. Glob. Optim. 18(1): 35-58 (2000) - Donghui Chen, Ding-Zhu Du, Xiao-Dong Hu, Guohui Lin, Lusheng Wang, Guoliang Xue:
Approximations for Steiner Trees with Minimum Number of Steiner Points. J. Glob. Optim. 18(1): 17-33 (2000) - Chuangyin Dang, Lei Xu:
A Barrier Function Method for the Nonconvex Quadratic Programming Problem with Box Constraints. J. Glob. Optim. 18(2): 165-188 (2000) - David Draper, Dimitris Fouskakis:
A Case Study of Stochastic Optimization in Health Policy: Problem Formulation and Preliminary Results. J. Glob. Optim. 18(4): 399-416 (2000) - Weiwu Fang, Tianjiao Wu, Jianping Chen:
An Algorithm of Global Optimization for Rational Functions with Rational Constraints. J. Glob. Optim. 18(3): 211-218 (2000) - Eligius M. T. Hendrix, Olivier Klepper:
On Uniform Covering, Adaptive Random Search and Raspberries. J. Glob. Optim. 18(2): 143-163 (2000) - Frank K. Hwang, M. M. Liao, Chiuyuan Chen:
Supermodularity in Various Partition Problems. J. Glob. Optim. 18(3): 275-282 (2000) - Hiroshi Konno, Kenji Fukaishi:
A Branch and Bound Algorithm for Solving Low Rank Linear Multiplicative and Fractional Programming Problems. J. Glob. Optim. 18(3): 283-299 (2000) - Takahito Kuno, Takahiro Utsunomiya:
A Lagrangian Based Branch-and-Bound Algorithm for Production-transportation Problems. J. Glob. Optim. 18(1): 59-73 (2000) - Robert H. Leary:
Global Optimization on Funneling Landscapes. J. Glob. Optim. 18(4): 367-383 (2000) - Duan Li, Xiaoling Sun:
Success Guarantee of Dual Search in Integer Programming: p-th Power Lagrangian Method. J. Glob. Optim. 18(3): 235-253 (2000) - Marco Locatelli:
Convergence of a Simulated Annealing Algorithm for Continuous Global Optimization. J. Glob. Optim. 18(3): 219-233 (2000) - Marco Locatelli, Nguyen V. Thoai:
Finite Exact Branch-and-Bound Algorithms for Concave Minimization over Polytopes. J. Glob. Optim. 18(2): 107-128 (2000) - Christophe Meyer:
A Simple Finite Cone Covering Algorithm for Concave Minimization. J. Glob. Optim. 18(4): 357-365 (2000) - Muhammad Aslam Noor:
Splitting Algorithms for General Pseudomonotone Mixed Variational Inequalities. J. Glob. Optim. 18(1): 75-89 (2000) - Ivo Nowak:
Dual Bounds and Optimality Cuts for All-Quadratic Programs with Convex Constraints. J. Glob. Optim. 18(4): 337-356 (2000) - Panos M. Pardalos:
C.A. Floudas, Deterministic Global Optimization : Theory, Algorithms and Applica-tions. Kluwer Academic Publishers, 2000, 760 pp., 315 US$, hardbound, ISBN 0-7923-6041-1 (Nonconvex Optimization and Its Applications, Volume 37). J. Glob. Optim. 18(1): 103-105 (2000) - Suvrajeet Sen, Julia L. Higle, John R. Birge:
Duality Gaps in Stochastic Integer Programming. J. Glob. Optim. 18(2): 189-194 (2000) - Nguyen V. Thoai:
Conical Algorithm in Global Optimization for Optimizing over Efficient Sets. J. Glob. Optim. 18(4): 321-336 (2000) - Hoang Tuy, Le Tu Luc:
A New Approach to Optimization Under Monotonic Constraint. J. Glob. Optim. 18(1): 1-15 (2000) - Ram Vedantham:
Optimal Control of the Viscous Burgers Equation Using an Equivalent Index Method. J. Glob. Optim. 18(3): 255-263 (2000) - H. Paul Williams:
The Dual of a Logical Linear Programme. J. Glob. Optim. 18(2): 129-141 (2000)
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-12-23 19:39 CET 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