![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 42 matches
- 2022
- Nicolau Andrés-Thió, Marcus Brazil, Charl J. Ras
, Doreen A. Thomas, Marcus Volz:
An exact algorithm for constructing minimum Euclidean skeletons of polygons. J. Glob. Optim. 83(1): 137-162 (2022) - Charles Audet
, Frédéric Messine, Jordan Ninin:
Numerical certification of Pareto optimality for biobjective nonlinear problems. J. Glob. Optim. 83(4): 891-908 (2022) - Charles Audet
, Frédéric Messine, Jordan Ninin:
Correction to: Numerical certification of Pareto optimality for biobjective nonlinear problems. J. Glob. Optim. 83(4): 909-910 (2022) - Andrés D. Báez-Sánchez, Carlile Lavor, Antonio Mucherino:
Preface: special issue on optimization in distance geometry. J. Glob. Optim. 83(1): 1-2 (2022) - Cem Deniz Caglar Bozkir, O. Erhun Kundakcioglu
, Andrea C. Henry:
Hospital service levels during drug shortages: Stocking and transshipment policies for pharmaceutical inventory. J. Glob. Optim. 83(3): 565-584 (2022) - Maurizio Bruglieri
, Roberto Cordone
, Leo Liberti
:
Maximum feasible subsystems of distance geometry constraints. J. Glob. Optim. 83(1): 29-47 (2022) - Christoph Buchheim, Dorothee Henke
:
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective. J. Glob. Optim. 83(4): 803-824 (2022) - Regina Sandra Burachik, Yaohua Hu, Xiaoqi Yang
:
Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in hilbert spaces. J. Glob. Optim. 83(2): 249-271 (2022) - Sonia Cafieri
, Pierre Hansen, Frédéric Messine
:
Global exact optimization for covering a rectangle with 6 circles. J. Glob. Optim. 83(1): 163-185 (2022) - Dimitrije D. Cvokic
, Yury A. Kochetov
, Aleksandr V. Plyasunov, Aleksandar Savic:
A variable neighborhood search algorithm for the $ (r{\mid }p) $ hub-centroid problem under the price war. J. Glob. Optim. 83(3): 405-444 (2022) - Sean Dewar
, Derek Kitson
, Anthony Nixon
:
Which graphs are rigid in ℓ pd? J. Glob. Optim. 83(1): 49-71 (2022) - Huynh Thi Hong Diem:
Consistency of statistical estimators of solutions to stochastic optimization problems. J. Glob. Optim. 83(4): 825-842 (2022) - Phillip M. Duxbury, Carlile Lavor, Leo Liberti, Luiz Leduíno de Salles Neto
:
Unassigned distance geometry and molecular conformation problems. J. Glob. Optim. 83(1): 73-82 (2022) - Gabriele Eichfelder
, Leo Warnow
:
An approximation algorithm for multi-objective optimization problems using a box-coverage. J. Glob. Optim. 83(2): 329-357 (2022) - José F. S. Bravo Ferreira
, David Cowburn
, Yuehaw Khoo, Amit Singer
:
NMR assignment through linear programming. J. Glob. Optim. 83(1): 3-28 (2022) - Zijun Hao, Chieu Thanh Nguyen, Jein-Shan Chen
:
An approximate lower order penalty approach for solving second-order cone linear complementarity problems. J. Glob. Optim. 83(4): 671-697 (2022) - Saeid Ansary Karbasy, Maziar Salahi
:
On the branch and bound algorithm for the extended trust-region subproblem. J. Glob. Optim. 83(2): 221-233 (2022) - Alexander V. Kononov
, Julia Memar
, Yakov Zinder
:
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements. J. Glob. Optim. 83(3): 445-456 (2022) - Alexander V. Kononov, Yulia V. Zakharova
:
Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion. J. Glob. Optim. 83(3): 539-564 (2022) - Olga I. Kostyukova, Tatiana V. Tchemisova
:
On strong duality in linear copositive programming. J. Glob. Optim. 83(3): 457-480 (2022) - Javad Koushki
, Kaisa Miettinen
, Majid Soleimani-Damaneh:
LR-NIMBUS: an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions. J. Glob. Optim. 83(4): 843-863 (2022) - Gabriela Kovácová
, Birgit Rudloff
:
Convex projection and convex multi-objective optimization. J. Glob. Optim. 83(2): 301-327 (2022) - Emel Seyma Küçükasci, Mustafa Gökçe Baydogan
, Z. Caner Taskin:
Multiple instance classification via quadratic programming. J. Glob. Optim. 83(4): 639-670 (2022) - Takahito Kuno
:
A revision of the rectangular algorithm for a class of DC optimization problems. J. Glob. Optim. 83(2): 187-200 (2022) - Vadim E. Levit
, Eugen Mandrescu
:
Critical sets, crowns and local maximum independent sets. J. Glob. Optim. 83(3): 481-495 (2022) - Haiyang Li, Qian Zhang, Shoujin Lin, Jigen Peng:
Sparse signal recovery via generalized gaussian function. J. Glob. Optim. 83(4): 783-801 (2022) - Leo Liberti
, Benedetto Manca:
Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections. J. Glob. Optim. 83(1): 83-118 (2022) - Deyi Liu
, Volkan Cevher
, Quoc Tran-Dinh
:
A Newton Frank-Wolfe method for constrained self-concordant minimization. J. Glob. Optim. 83(2): 273-299 (2022) - Marco Locatelli
:
Exact and approximate results for convex envelopes of special structured functions over simplices. J. Glob. Optim. 83(2): 201-220 (2022) - Cheng Lu, Wenguo Yang
, Suixiang Gao:
A new greedy strategy for maximizing monotone submodular function under a cardinality constraint. J. Glob. Optim. 83(2): 235-247 (2022)
skipping 12 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-22 00:09 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