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 30 matches
- 2005
- Elisabetta Alvoni, Pier Luigi Papini:
Perturbation of Sets and Centers. J. Glob. Optim. 33(3): 423-434 (2005) - Kurt M. Anstreicher, Samuel Burer:
D.C. Versus Copositive Bounds for Standard QP. J. Glob. Optim. 33(2): 299-312 (2005) - Mette Bjørndal, Kurt Jørnsten:
The Deregulated Electricity Market Viewed as a Bilevel Programming Problem. J. Glob. Optim. 33(3): 465-475 (2005) - Riccardo Cambini, Claudio Sodini:
Decomposition Methods for Solving Nonconvex Quadratic Programs via Branch and Bound. J. Glob. Optim. 33(3): 313-336 (2005) - F. H. Chang, Frank K. Hwang:
Supermodularity in Mean-Partition Problems. J. Glob. Optim. 33(3): 337-347 (2005) - Shu-Cherng Fang, Jiye Han, Zheng-Hai Huang, S. Ilker Birbil:
On the Finite Termination of an Entropy Function Based Non-Interior Continuation Method for Vertical Linear Complementarity Problems. J. Glob. Optim. 33(3): 369-391 (2005) - Nazih Abderrazzak Gadhi, Mohamed Laghdir, Abdelmoutalib Metrane:
Optimality Conditions for D.C. Vector Optimization Problems Under Reverse Convex Constraints. J. Glob. Optim. 33(4): 527-540 (2005) - George Isac, Sándor Zoltán Németh:
Duality in Multivalued Complementarity Theory by Using Inversions and Scalar Derivatives. J. Glob. Optim. 33(2): 197-213 (2005) - Vladik Kreinovich, R. Baker Kearfott:
Beyond Convex? Global Optimization is Feasible Only for Convex Objective Functions: A Theorem. J. Glob. Optim. 33(4): 617-624 (2005) - Takahito Kuno:
A Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios Problems. J. Glob. Optim. 33(2): 215-234 (2005) - Manuel Laguna, Rafael Martí:
Experimental Testing of Advanced Scatter Search Designs for Global Optimization of Multimodal Functions. J. Glob. Optim. 33(2): 235-255 (2005) - Gue Myung Lee, Do Sang Kim, Pham Huu Sach:
Characterizations of Hartley Proper Efficiency in Nonconvex Vector Optimization. J. Glob. Optim. 33(2): 273-298 (2005) - Jian-Ling Li, Jin-Bao Jian:
A Superlinearly Convergent SSLE Algorithm for Optimization Problems with Linear Complementarity Constraints. J. Glob. Optim. 33(4): 477-510 (2005) - Han-Lin Li, Jung-Fa Tsai:
Treating Free Variables in Generalized Geometric Global Optimization Programs. J. Glob. Optim. 33(1): 1-13 (2005) - Leo Liberti:
Linearity Embedded in Nonconvex Programs. J. Glob. Optim. 33(2): 157-196 (2005) - Lai-Jiu Lin:
Existence Results for Primal and Dual Generalized Vector Equilibrium Problems With Applications to Generalized Semi-Infinite Programming. J. Glob. Optim. 33(4): 579-595 (2005) - Alfredo Marín:
Uncapacitated Euclidean Hub Location: Strengthened Formulation, New Facets and a Relax-and-cut Algorithm. J. Glob. Optim. 33(3): 393-422 (2005) - Laxmi Narain, P. C. Bagga:
Flowshop/No-idle Scheduling to Minimize Total Elapsed Time. J. Glob. Optim. 33(3): 349-367 (2005) - Jiawang Nie, James Demmel:
Minimum Ellipsoid Bounds for Solutions of Polynomial Systems via Sum of Squares. J. Glob. Optim. 33(4): 511-525 (2005) - Shmuel Onn, Uriel G. Rothblum, Yoav Tangir:
Edge-Directions of Standard Polyhedra with Applications to Network Flows. J. Glob. Optim. 33(1): 109-122 (2005) - Ioannis Papamichail, Claire S. Adjiman:
Proof of Convergence for a Global Optimization Algorithm for Problems with Ordinary Differential Equations. J. Glob. Optim. 33(1): 83-107 (2005) - Hermann Schichl, Arnold Neumaier:
Interval Analysis on Directed Acyclic Graphs for Global Optimization. J. Glob. Optim. 33(4): 541-562 (2005) - Hanif D. Sherali, Jitamitra Desai:
A Global Optimization RLT-based Approach for Solving the Fuzzy Clustering Problem. J. Glob. Optim. 33(4): 597-615 (2005) - Chenggen Shi, Guangquan Zhang, Jie Lu:
The K th-Best Approach for Linear Bilevel Multi-follower Programming. J. Glob. Optim. 33(4): 563-578 (2005) - Andras Sobester, Stephen J. Leary, Andy J. Keane:
On the Design of Optimization Strategies Based on Global Response Surface Approximation Models. J. Glob. Optim. 33(1): 31-59 (2005) - Min Sun, A. W. Johnson:
Interval Branch and Bound with Local Sampling for Constrained Global Optimization. J. Glob. Optim. 33(1): 61-82 (2005) - Xiaoling Sun, F. L. Wang, Duan Li:
Exact Algorithm for Concave Knapsack Problems: Linear Underestimation and Partition Method. J. Glob. Optim. 33(1): 15-30 (2005) - Yifan Xu, Chunli Liu, Duan Li:
Generalized Nonlinear Lagrangian Formulation for Bounded Integer Programming. J. Glob. Optim. 33(2): 257-272 (2005) - Shangyao Yan, Der-shin Juang, Chien-rong Chen, Wei Shen Lai:
Global and Local Search Algorithms for Concave Cost Transshipment Problems. J. Glob. Optim. 33(1): 123-156 (2005) - Yushan Zhu, Takahito Kuno:
A Global Optimization Method, QBB, for Twice-Differentiable Nonconvex Optimization Problem. J. Glob. Optim. 33(3): 435-464 (2005)
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-22 14:04 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