Остановите войну!
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 45 matches
- 2011
- Soizic Adam, J. Frédéric Bonnans, Ruben Paraisy, Sébastien Veyrat:
Application of convex lexicographical optimization to the balance of GRTgaz gas grid. J. Glob. Optim. 49(3): 415-423 (2011) - Daniel Aloise, Pierre Hansen:
Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering. J. Glob. Optim. 49(3): 449-465 (2011) - Le Thi Hoai An, Pham Dinh Tao, Nguyen Dong Yen:
Properties of two DC algorithms in quadratic programming. J. Glob. Optim. 49(3): 481-495 (2011) - Nikolaos Argyris, José Rui Figueira, Alec Morton:
Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem. J. Glob. Optim. 49(2): 213-235 (2011) - Charles Audet, Anthony Guillou, Pierre Hansen, Frédéric Messine, Sylvain Perron:
The small hexagon and heptagon with maximum sum of distances between vertices. J. Glob. Optim. 49(3): 467-480 (2011) - S. Sadiq Basha:
Best proximity points: global optimal approximate solutions. J. Glob. Optim. 49(1): 15-21 (2011) - Boubakeur Benahmed, Hocine Mokhtar-Kharroubi, Bruno de Malafosse, Adnan Yassine:
Quasi-Newton methods in infinite-dimensional spaces and application to matrix equations. J. Glob. Optim. 49(3): 365-379 (2011) - Mohamed Didi Biha, Marie-Jean Meurs:
An exact algorithm for solving the vertex separator problem. J. Glob. Optim. 49(3): 425-434 (2011) - Jiawei Chen, Yeol Je Cho, Jong Kyu Kim, Jun Li:
Multiobjective optimization problems with modified objective functions and cone constraints and applications. J. Glob. Optim. 49(1): 137-147 (2011) - Alexei A. Gaivoronski, Abdel Lisser, Rafael Lopez, Hu Xu:
Knapsack problem with probability constraints. J. Glob. Optim. 49(3): 397-413 (2011) - Suogang Gao, Zengti Li, Hongjie Du, Yan Shi, Weili Wu:
Approaching pooling design with smaller efficient ratio. J. Glob. Optim. 49(1): 125-135 (2011) - Xunhua Gong:
Chebyshev scalarization of solutions to the vector equilibrium problems. J. Glob. Optim. 49(4): 607-622 (2011) - Ronaldo Gregório, Paulo Roberto Oliveira:
A logarithmic-quadratic proximal point scalarization method for multiobjective programming. J. Glob. Optim. 49(2): 281-291 (2011) - Yongpei Guan:
Stochastic lot-sizing with backlogging: computational complexity analysis. J. Glob. Optim. 49(4): 651-678 (2011) - Anjana Gupta, Aparna Mehra, Davinder Bhatia:
Characterizing strict efficiency for convex multiobjective programming problems. J. Glob. Optim. 49(2): 265-280 (2011) - César Gutiérrez, Bienvenido Jiménez, Vicente Novo:
A generic approach to approximate efficiency and applications to vector optimization with set-valued maps. J. Glob. Optim. 49(2): 313-342 (2011) - Vaithilingam Jeyakumar, Guoyin Li:
Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems. J. Glob. Optim. 49(1): 1-14 (2011) - Nader Kanzi:
Necessary optimality conditions for nonsmooth semi-infinite programming problems. J. Glob. Optim. 49(4): 713-725 (2011) - Suhel Ahmad Khan:
Generalized vector implicit quasi complementarity problems. J. Glob. Optim. 49(4): 695-705 (2011) - Phan Quoc Khanh, Dinh Ngoc Quy:
On generalized Ekeland's variational principle and equivalent formulations for set-valued mappings. J. Glob. Optim. 49(3): 381-396 (2011) - Igor V. Konnov, D. A. Dyabilkin:
Nonmonotone equilibrium problems: coercivity conditions and weak regularization. J. Glob. Optim. 49(4): 575-587 (2011) - Ralf Leidenberger, Karsten Urban:
Automatic differentiation for the optimization of a ship propulsion and steering system: a proof of concept. J. Glob. Optim. 49(3): 497-504 (2011) - Chuan Lin, Anyong Qing, Quanyuan Feng:
A new differential mutation base generator for differential evolution. J. Glob. Optim. 49(1): 69-90 (2011) - Marie Luong, Quoc Bao Do, Azeddine Beghdadi:
A blind image watermarking using multiresolution visibility map. J. Glob. Optim. 49(3): 435-448 (2011) - George Mavrotas, José Rui Figueira, Alexandros Antoniadis:
Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems. J. Glob. Optim. 49(4): 589-606 (2011) - Sanjay Mehrotra, Zhifeng Li:
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices. J. Glob. Optim. 49(4): 623-649 (2011) - Xin-He Miao, Zheng-Hai Huang:
The column-sufficiency and row-sufficiency of the linear transformation on Hilbert spaces. J. Glob. Optim. 49(1): 109-123 (2011) - Michel Minoux:
On 2-stage robust LP with RHS uncertainty: complexity results and applications. J. Glob. Optim. 49(3): 521-537 (2011) - H. Mohebi, Mehdi Vatandoost:
Counterexamples on some articles on quasi-variational inclusion problems. J. Glob. Optim. 49(4): 707-712 (2011) - P. S. V. Nataraj, M. Arounassalame:
Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm. J. Glob. Optim. 49(2): 185-212 (2011)
skipping 15 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-05-24 10:24 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