![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 3,368 matches
- 2024
- Lam Quoc Anh, Pham Thanh Duoc, Ha Manh Linh:
Scalar representations and Hausdorff continuity of solution mappings to parametric set optimization problems via set less order relations. Oper. Res. Lett. 53: 107071 (2024) - René van Bevern
, Daniel A. Skachkov
:
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number. Oper. Res. Lett. 52: 107065 (2024) - Jose H. Blanchet, Arun Jambulapati, Carson Kent
, Aaron Sidford
:
Towards optimal running timesfor optimal transport. Oper. Res. Lett. 52: 107054 (2024) - Emelin L. Buscaglia
, Pablo A. Lotito
, Lisandro A. Parente:
An inexact algorithm for stochastic variational inequalities. Oper. Res. Lett. 52: 107064 (2024) - Jiehua Chen, Danny Hermelin, Manuel Sorge:
A note on clustering aggregation for binary clusterings. Oper. Res. Lett. 52: 107052 (2024) - Antoine Deza, Sebastian Pokutta, Lionel Pournin:
The complexity of geometric scaling. Oper. Res. Lett. 52: 107057 (2024) - Collin Drent
, Melvin Drent
, Geert-Jan van Houtum
:
Optimal data pooling for shared learning in maintenance operations. Oper. Res. Lett. 52: 107056 (2024) - Kerry W. Fendick, Ward Whitt
:
On Gaussian Markov processes and Polya processes. Oper. Res. Lett. 52: 107062 (2024) - Andrés Gómez
, Weijun Xie
:
A note on quadratic constraints with indicator variables: Convex hull description and perspective relaxation. Oper. Res. Lett. 52: 107059 (2024) - Shaoning Han
, Xinyao Zhang
, Jong-Shi Pang:
On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs. Oper. Res. Lett. 53: 107091 (2024) - Yasar Levent Koçaga
:
Universally optimal staffing of Erlang-A queues facing uncertain arrival rates. Oper. Res. Lett. 52: 107061 (2024) - Mohammad Lotfi, Alexandros A. Voudouris
:
On truthful constrained heterogeneous facility location with max-variant cost. Oper. Res. Lett. 52: 107060 (2024) - Wentao Lu
:
Bounds on revenue for the random consideration set choice model. Oper. Res. Lett. 53: 107070 (2024) - Renee Mirka
, David P. Williamson:
Max cut and semidefinite rank. Oper. Res. Lett. 53: 107067 (2024) - Lijun Pan:
Strategic inattention of multi-product firms with free entry. Oper. Res. Lett. 52: 107068 (2024) - Yiming Peng, Vadim Linetsky:
Partially egalitarian portfolio selection. Oper. Res. Lett. 52: 107055 (2024) - Thi Hoai Pham
, Nguyen The Vinh, Nguyen Phung Hai Chung:
A novel stepsize for gradient descent method. Oper. Res. Lett. 53: 107072 (2024) - Gabriel Ponte, Marcia Fampa, Jon Lee
, Luze Xu
:
On computing sparse generalized inverses. Oper. Res. Lett. 52: 107058 (2024) - Abdul Quadir:
Demand information sharing in Cournot-Bertrand model. Oper. Res. Lett. 53: 107069 (2024) - Ismail Saglam
:
Must pollution abatement harm the supplier in a multi-echelon supply chain? Oper. Res. Lett. 53: 107066 (2024) - Gang Wang, Yihan Fu:
Characterizing the nonemptiness and compactness of weakly efficient solution sets for non-convex multiobjective optimization problems. Oper. Res. Lett. 53: 107092 (2024) - Shaunna Whitters:
Publisher's note. Oper. Res. Lett. 52: 107085 (2024) - Bowen Xie
, Yijin Gao:
Diffusion approximation of a special bandwidth sharing model via infinitesimal generators with a lifting-projection method. Oper. Res. Lett. 52: 107063 (2024) - Yinlian Zeng
, Siyi Wang
, Xiaoqiang Cai, Lianmin Zhang:
Incentive-compatible cost allocations for inventory games with private information. Oper. Res. Lett. 53: 107073 (2024) - Houshan Zhang, Jianhua Yuan
:
A combined variable aggregation presolving technique for mixed integer programming. Oper. Res. Lett. 53: 107074 (2024) - 2023
- Karen I. Aardal
, Lara Scavuzzo
, Laurence A. Wolsey:
A study of lattice reformulations for integer programming. Oper. Res. Lett. 51(4): 401-407 (2023) - Mahmoud Affouf, Jiantian Wang
:
Answer to an open problem about stochastic comparison of parallel systems with geometric components. Oper. Res. Lett. 51(2): 176-178 (2023) - Rachael M. Alfant, Temitayo Ajayi, Andrew J. Schaefer
:
Evaluating mixed-integer programming models over multiple right-hand sides. Oper. Res. Lett. 51(4): 414-420 (2023) - Abhinav Anand, Souvik Dutta, Prithwiraj Mukherjee
:
Platform exploitation in the sharing economy. Oper. Res. Lett. 51(1): 47-53 (2023) - Ilan Doron Arad, Ariel Kulik
, Hadas Shachnai
:
An FPTAS for budgeted laminar matroid independent set. Oper. Res. Lett. 51(6): 632-637 (2023)
skipping 3,338 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-07-11 05:21 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