Остановите войну!
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 120 matches
- 2022
- Babak Abbasi, Joanna Bruzda, Nagesh Gavirneni:
Optimal operational service levels in vendor managed inventory contracts - an exact approach. Oper. Res. Lett. 50(5): 610-617 (2022) - Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Testing idealness in the filter oracle model. Oper. Res. Lett. 50(6): 753-755 (2022) - Luca Accorsi, Andrea Lodi, Daniele Vigo:
Guidelines for the computational testing of machine learning approaches to vehicle routing problems. Oper. Res. Lett. 50(2): 229-234 (2022) - Asrar Ahmed, Milind G. Sohoni, Chaithanya Bandi:
Parameterized approximations for the two-sided assortment optimization. Oper. Res. Lett. 50(4): 399-406 (2022) - Deniz Akturk:
Managing inventory in a network: Performance bounds for simple policies. Oper. Res. Lett. 50(3): 315-321 (2022) - Stéphane Alarie, Charles Audet, Paulin Jacquot, Sébastien Le Digabel:
Hierarchically constrained blackbox optimization. Oper. Res. Lett. 50(5): 446-451 (2022) - Maxwell Allman, Venus Lo, S. Thomas McCormick:
Complexity of Source-Sink Monotone 2-parameter min cut. Oper. Res. Lett. 50(1): 84-90 (2022) - Manuel Aprile:
Extended formulations for matroid polytopes through randomized protocols. Oper. Res. Lett. 50(2): 145-149 (2022) - Hayriye Ayhan:
Optimal admission control in queues with abandonments. Oper. Res. Lett. 50(6): 712-718 (2022) - Stéphane R. A. Barde, Young Myoung Ko, Hayong Shin:
General EM algorithm for fitting non-monotone hazard functions from truncated and censored observations. Oper. Res. Lett. 50(5): 476-483 (2022) - Amir Beck, Nadav Hallak:
The regularized feasible directions method for nonconvex optimization. Oper. Res. Lett. 50(5): 517-523 (2022) - Amir Beck, Raz Sharon:
New results on multi-dimensional linear discriminant analysis. Oper. Res. Lett. 50(1): 1-7 (2022) - E. Ruben van Beesten, Ward Romeijnders:
Parametric error bounds for convex approximations of two-stage mixed-integer recourse models with a random second-stage cost vector. Oper. Res. Lett. 50(5): 541-547 (2022) - Sebastian Berndt, Franziska Eberle, Nicole Megow:
Online load balancing with general reassignment cost. Oper. Res. Lett. 50(3): 322-328 (2022) - Martin Böhm, Nicole Megow, Jens Schlöter:
Throughput scheduling with equal additive laxity. Oper. Res. Lett. 50(5): 463-469 (2022) - Matthew Bold, Marc Goerigk:
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem. Oper. Res. Lett. 50(5): 581-587 (2022) - Matthias Brugger, Andreas S. Schulz:
On the complexity of recognizing integrality and total dual integrality of the {0, 1/2}-closure. Oper. Res. Lett. 50(1): 16-19 (2022) - Christoph Buchheim, Emiliano Traversi:
Convex optimization under combinatorial sparsity constraints. Oper. Res. Lett. 50(6): 632-638 (2022) - Minh N. Bùi:
A decomposition method for solving multicommodity network equilibria. Oper. Res. Lett. 50(1): 40-44 (2022) - René Caldentey, Avi Giloni, Clifford Hurvich:
Performance bound for myopic order-up-to inventory policies under stationary demand processes. Oper. Res. Lett. 50(5): 588-595 (2022) - Ping Cao, Dacheng Yao:
Optimal pricing and inventory control strategy for a continuous-review system with product return. Oper. Res. Lett. 50(3): 295-302 (2022) - Ellen Cardinaels, Sem C. Borst, Johan S. H. van Leeuwaarden:
Power-of-two sampling in redundancy systems: The impact of assignment constraints. Oper. Res. Lett. 50(6): 699-706 (2022) - André Casajus, Michael Kramm:
Solutions for non-negatively weighted TU games derived from extension operators. Oper. Res. Lett. 50(5): 484-487 (2022) - André Casajus, Michael Kramm:
Asymptotic stability in replicator dynamics derived from TU games. Oper. Res. Lett. 50(6): 650-654 (2022) - Marta Cavaleiro, Farid Alizadeh:
A branch-and-bound method for the minimum k-enclosing ball problem. Oper. Res. Lett. 50(3): 274-280 (2022) - Yajing Chen, Yanyue Huang, Zhenhua Jiao, Yunfan Zhao:
A comparison study on responsiveness of three mechanisms to affirmative action in school choice. Oper. Res. Lett. 50(5): 488-494 (2022) - Pengzhan Chen, Yingda Song:
Irreversible investment with random delay and partial prepayment. Oper. Res. Lett. 50(5): 434-440 (2022) - Hongyu Chen, Zizhuo Wang:
Optimal control for parallel queues with a single batch server. Oper. Res. Lett. 50(4): 377-383 (2022) - Matthias Claus, Kai Spürkel:
Improving constants of strong convexity in linear stochastic programming. Oper. Res. Lett. 50(1): 76-83 (2022) - Andrés Cristi, Marc Schröder:
Negative prices in network pricing games. Oper. Res. Lett. 50(2): 99-106 (2022)
skipping 90 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-06 00:58 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