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
- 1998
- Le Thi Hoai An, Pham Dinh Tao:
A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems. J. Glob. Optim. 13(2): 171-206 (1998) - Harold P. Benson:
An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem. J. Glob. Optim. 13(1): 1-24 (1998) - Immanuel M. Bomze:
On Standard Quadratic Optimization Problems. J. Glob. Optim. 13(4): 369-387 (1998) - Francis H. Clarke, Jean-Baptiste Hiriart-Urruty, Yuri S. Ledyaev:
On Global Optimality Conditions for Nonlinear Optimal Control Problems. J. Glob. Optim. 13(2): 109-122 (1998) - Frans M. Coetzee, Virginia L. Stonick:
On Producing Multiple Solutions Using Repeated Trials. J. Glob. Optim. 13(3): 241-254 (1998) - Derek R. Dreyer, Michael L. Overton:
Two Heuristics for the Euclidean Steiner Tree Problem. J. Glob. Optim. 13(1): 95-106 (1998) - Marco Gaviano, Daniela Lera:
Test Functions with Variable Attraction Regions for Global Optimization Problems. J. Glob. Optim. 13(2): 207-223 (1998) - Jean-Baptiste Hiriart-Urruty:
Conditions for Global Optimality 2. J. Glob. Optim. 13(4): 349-367 (1998) - Reiner Horst, Ulrich Raber:
Convergent Outer Approximation Algorithms for Solving Unary Programs. J. Glob. Optim. 13(2): 123-149 (1998) - Brigitte Jaumard, Christophe Meyer:
A Simplified Convergence Proof for the Cone Partitioning Algorithm. J. Glob. Optim. 13(4): 407-416 (1998) - Donald R. Jones, Matthias Schonlau, William J. Welch:
Efficient Global Optimization of Expensive Black-Box Functions. J. Glob. Optim. 13(4): 455-492 (1998) - Alexander Kaplan, Rainer Tichatschke:
Proximal Point Methods and Nonconvex Optimization. J. Glob. Optim. 13(4): 389-406 (1998) - Konstantin Kogan, Eugene Khmelnitsky:
Tracking Demands in Optimal Control of Managerial Systems with Continuously-Divisible, Doubly Constrained Resources. J. Glob. Optim. 13(1): 43-59 (1998) - Hiroshi Konno, Chenggang Gao, Ichiroh Saitoh:
Cutting Plane/Tabu Search Algorithms for Low Rank Concave Quadratic Programming Problems. J. Glob. Optim. 13(3): 225-240 (1998) - Bernard Lemaire, Michel Volle:
A General Duality Scheme for Nonconvex Minimization Problems with a Strict Inequality Constraint. J. Glob. Optim. 13(3): 317-327 (1998) - E. Levitin, Rainer Tichatschke:
A Branch-and-Bound Approach for Solving a Class of Generalized Semi-infinite Programming Problems. J. Glob. Optim. 13(3): 299-315 (1998) - Chyi-Yeu Lin, I-Ming Huang:
A Crystal Growth Approach for Topographical Global Optimization. J. Glob. Optim. 13(3): 255-267 (1998) - Marco Locatelli:
Relaxing the Assumptions of the Multilevel Single Linkage Algorithm. J. Glob. Optim. 13(1): 25-42 (1998) - Markku Miettinen, P. D. Panagiotopoulos:
Hysteresis and Hemivariational Inequalities: Semilinear Case. J. Glob. Optim. 13(3): 269-298 (1998) - Werner Oettli, Dirk Schläger:
Conjugate Functions for Convex and Nonconvex Duality. J. Glob. Optim. 13(4): 337-347 (1998) - Jean-François Puget, Pascal Van Hentenryck:
A Constraint Satisfaction Approach to a Circuit Design Problem. J. Glob. Optim. 13(1): 75-93 (1998) - Ulrich Raber:
A Simplicial Branch-and-Bound Method for Solving Nonconvex All-Quadratic Programs. J. Glob. Optim. 13(4): 417-432 (1998) - Fabio Schoen:
Random and Quasi-Random Linkage Methods in Global Optimization. J. Glob. Optim. 13(4): 445-454 (1998) - Alexander S. Strekalovsky, Ider Tseveendorj:
Testing the ℜ- strategy for a Reverse Convex Problem. J. Glob. Optim. 13(1): 61-74 (1998) - Yasutoshi Yajima, Tetsuya Fujie:
A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box Constraints. J. Glob. Optim. 13(2): 151-170 (1998) - Zelda B. Zabinsky:
Stochastic Methods for Practical Global Optimization. J. Glob. Optim. 13(4): 433-444 (1998)
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 2025-01-04 02:19 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