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 134 matches
- 2018
- Samir Adly, Ba Khiet Le:
On semicoercive sweeping process with velocity constraint. Optim. Lett. 12(4): 831-843 (2018) - Boualem Alleche, Vicentiu D. Radulescu:
Further on set-valued equilibrium problems in the pseudo-monotone case and applications to Browder variational inclusions. Optim. Lett. 12(8): 1789-1810 (2018) - Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl:
An exact solution framework for the minimum cost dominating tree problem. Optim. Lett. 12(7): 1669-1681 (2018) - Charles Audet, Amina Ihaddadene, Sébastien Le Digabel, Christophe Tribes:
Robust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm. Optim. Lett. 12(4): 675-689 (2018) - Jianchao Bai, Hongchao Zhang, Jicheng Li:
A parameterized proximal point algorithm for separable convex optimization. Optim. Lett. 12(7): 1589-1608 (2018) - R. Balaji, K. Palpandi:
Positive definite and Gram tensor complementarity problems. Optim. Lett. 12(3): 639-648 (2018) - Heinz H. Bauschke, Walaa M. Moursi:
The magnitude of the minimal displacement vector for compositions and convex combinations of firmly nonexpansive mappings. Optim. Lett. 12(7): 1465-1474 (2018) - Glaydston de Carvalho Bento, Orizon Pereira Ferreira, Valdinês Leite de Sousa Júnior:
Proximal point method for a special class of nonconvex multiobjective optimization functions. Optim. Lett. 12(2): 311-320 (2018) - Glaydston de Carvalho Bento, João Xavier da Cruz Neto, Paulo Sérgio Marques dos Santos, Simone do Rócio Senger de Souza:
A weighting subgradient algorithm for multiobjective optimization. Optim. Lett. 12(2): 399-410 (2018) - Radu Ioan Bot, Ernö Robert Csetnek, Nimit Nimana:
Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data. Optim. Lett. 12(1): 17-33 (2018) - Mousaab Bouafia, Djamel Benterki, Adnan Yassine:
An efficient parameterized logarithmic kernel function for linear optimization. Optim. Lett. 12(5): 1079-1097 (2018) - Giuseppe Caristi, Nader Kanzi, Majid Soleimani-Damaneh:
On gap functions for nonsmooth multiobjective optimization problems. Optim. Lett. 12(2): 273-286 (2018) - Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Selene Silvestri:
On the complexity of rainbow spanning forest problem. Optim. Lett. 12(3): 443-454 (2018) - Huilan Chang, Hung-Lin Fu, Chih-Huai Shih:
Learning a hidden uniform hypergraph. Optim. Lett. 12(1): 55-62 (2018) - André B. Chassein, Marc Goerigk:
On scenario aggregation to approximate robust combinatorial optimization problems. Optim. Lett. 12(7): 1523-1533 (2018) - Wei-An Chen, Zhen Zhu, Nan Kong:
A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs. Optim. Lett. 12(1): 155-169 (2018) - Bayi Cheng, Jun Pei, Kai Li, Panos M. Pardalos:
Integrated scheduling of production and distribution for manufacturers with parallel batching facilities. Optim. Lett. 12(7): 1609-1623 (2018) - Frank E. Curtis, Zachary Lubberts, Daniel P. Robinson:
Concise complexity analyses for trust region methods. Optim. Lett. 12(8): 1713-1724 (2018) - Claudia D'Ambrosio, Fabio Furini, Michele Monaci, Emiliano Traversi:
On the Product Knapsack Problem. Optim. Lett. 12(4): 691-712 (2018) - Zsolt Darvay, Petra-Renáta Takács:
New method for determining search directions for interior-point algorithms in linear optimization. Optim. Lett. 12(5): 1099-1116 (2018) - Maxence Delorme, Manuel Iori, Silvano Martello:
BPPLIB: a library for bin packing and cutting stock problems. Optim. Lett. 12(2): 235-250 (2018) - Ke-wei Ding, Ming-hui Wang, Nan-Jing Huang:
Distributionally robust chance constrained problem under interval distribution information. Optim. Lett. 12(6): 1315-1328 (2018) - Margarita Domènech, José Miguel Giménez, María Albina Puente:
Semivalues: weighting coefficients and allocations on unanimity games. Optim. Lett. 12(8): 1841-1854 (2018) - Qiao-Li Dong, Yeol Je Cho, Themistocles M. Rassias:
The projection and contraction methods for finding common solutions to variational inequality problems. Optim. Lett. 12(8): 1871-1896 (2018) - Qiao-Li Dong, H. B. Yuan, Y. J. Cho, Themistocles M. Rassias:
Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings. Optim. Lett. 12(1): 87-102 (2018) - Marius Durea, Radu Strugariu:
Optimality conditions and a barrier method in optimization with convex geometric constraint. Optim. Lett. 12(4): 923-931 (2018) - Alexander V. Fominyh, V. V. Karelin, Lyudmila N. Polyakova:
Application of the hypodifferential descent method to the problem of constructing an optimal control. Optim. Lett. 12(8): 1825-1839 (2018) - Antonio Frangioni, Bernard Gendron, Enrico Gorgone:
Dynamic smoothness parameter for fast gradient methods. Optim. Lett. 12(1): 43-53 (2018) - Peter Frankl:
An exact result for (0, ± 1)-vectors. Optim. Lett. 12(5): 1011-1017 (2018) - Alberto Franzin, Leslie Pérez Cáceres, Thomas Stützle:
Effect of transformations of numerical parameters in automatic algorithm configuration. Optim. Lett. 12(8): 1741-1753 (2018)
skipping 104 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-09-25 02:53 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