Остановите войну!
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 38 matches
- 2010
- Samir Adly, Maïtine Bergounioux, Mohamed Ait Mansour:
Optimal control of a quasi-variational obstacle problem. J. Glob. Optim. 47(3): 421-435 (2010) - Amir Beck, Aharon Ben-Tal, Luba Tetruashvili:
A sequential parametric convex approximation method with applications to nonconvex truss topology design problems. J. Glob. Optim. 47(1): 29-51 (2010) - Gleb Beliakov, Alberto Ferrer:
Bounded lower subdifferentiability optimization techniques: applications. J. Glob. Optim. 47(2): 211-231 (2010) - Sonia Cafieri, Jon Lee, Leo Liberti:
On convex relaxations of quadrilinear terms. J. Glob. Optim. 47(4): 661-685 (2010) - Y. Chiang:
Vectorial exceptional families of elements. J. Glob. Optim. 47(1): 53-62 (2010) - Altannar Chinchuluun:
Preface. J. Glob. Optim. 47(3): 327 (2010) - Stephan Dempe, Nazih Abderrazzak Gadhi:
Second order optimality conditions for bilevel set optimization problems. J. Glob. Optim. 47(2): 233-245 (2010) - Peter A. DiMaggio Jr., Scott R. McAllister, Christodoulos A. Floudas, Xiao-Jiang Feng, Joshua D. Rabinowitz, Herschel Rabitz:
A network flow model for biclustering via optimal re-ordering of data matrices. J. Glob. Optim. 47(3): 343-354 (2010) - Wei-Shih Du:
Hybrid inclusion and disclusion systems with applications to equilibria and parametric optimization. J. Glob. Optim. 47(1): 119-132 (2010) - Marius Durea:
Remarks on strict efficiency in scalar and vector optimization. J. Glob. Optim. 47(1): 13-27 (2010) - Jean Bosco Etoa Etoa:
Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm. J. Glob. Optim. 47(4): 615-637 (2010) - David Yang Gao, Ning Ruan:
Solutions to quadratic minimization problems with box and integer constraints. J. Glob. Optim. 47(3): 463-484 (2010) - Pando G. Georgiev:
Parameterized variational inequalities. J. Glob. Optim. 47(3): 457-462 (2010) - Andrea Grosso, A. R. M. J. U. Jamali, Marco Locatelli, Fabio Schoen:
Solving the problem of packing equal and unequal circles in a circular container. J. Glob. Optim. 47(1): 63-81 (2010) - Yan-An Hwang, Yu-Hsien Liao:
The unit-level-core for multi-choice games: the replicated core for TU games. J. Glob. Optim. 47(2): 161-171 (2010) - Tibor Illés, Marianna Nagy, Tamás Terlaky:
A polynomial path-following interior point algorithm for general linear complementarity problems. J. Glob. Optim. 47(3): 329-342 (2010) - George Isac:
Quasi-bounded mappings and complementarity problems depending of parameters. J. Glob. Optim. 47(3): 355-367 (2010) - Nils Langenberg:
Pseudomonotone operators and the Bregman Proximal Point Algorithm. J. Glob. Optim. 47(4): 537-555 (2010) - Chen Ling, Qin Ni, Liqun Qi, Soon-Yi Wu:
A new smoothing Newton-type algorithm for semi-infinite programming. J. Glob. Optim. 47(1): 133-159 (2010) - Le Hoai Minh, Le Thi Hoai An, Pham Dinh Tao, Pascal Bouvry:
A combined DCA: GA for constructing highly nonlinear balanced boolean functions in cryptography. J. Glob. Optim. 47(4): 597-613 (2010) - Alexander Mitsos:
Global solution of nonlinear mixed-integer bilevel programs. J. Glob. Optim. 47(4): 557-582 (2010) - Abdellatif Moudafi:
Proximal methods for a class of bilevel monotone equilibrium problems. J. Glob. Optim. 47(2): 287-292 (2010) - Angelia Nedic, Asuman E. Ozdaglar:
Convergence rate for consensus with delays. J. Glob. Optim. 47(3): 437-456 (2010) - Rúbia M. Oliveira, Paulo A. V. Ferreira:
An outcome space approach for generalized convex multiplicative programs. J. Glob. Optim. 47(1): 107-118 (2010) - Jean-Paul Penot:
Are dualities appropriate for duality theories in optimization? J. Glob. Optim. 47(3): 503-525 (2010) - Qiusheng Qiu, Xinmin Yang:
Some properties of approximate solutions for vector optimization problem with set-valued functions. J. Glob. Optim. 47(1): 1-12 (2010) - Júlia Salamon:
Closedness and Hadamard well-posedness of the solution map for parametric vector equilibrium problems. J. Glob. Optim. 47(2): 173-183 (2010) - Martin Schlüter, Matthias Gerdts:
The oracle penalty method. J. Glob. Optim. 47(2): 293-325 (2010) - Gilbert Strang:
Maximum flows and minimum cuts in the plane. J. Glob. Optim. 47(3): 527-535 (2010) - Min Sun:
A fast memoryless interval-based algorithm for global optimization. J. Glob. Optim. 47(2): 247-271 (2010)
skipping 8 more matches
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-06-05 05:39 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