Остановите войну!
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 117 matches
- 2018
- Nishita Agarwal, Naveen Garg, Swati Gupta:
A 4/3-approximation for TSP on cubic 3-edge-connected graphs. Oper. Res. Lett. 46(4): 393-396 (2018) - Salihah Alwadani, Heinz H. Bauschke, Walaa M. Moursi, Xianfu Wang:
On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm. Oper. Res. Lett. 46(6): 585-587 (2018) - Alper Atamtürk, Oktay Günlük:
A note on capacity models for network design. Oper. Res. Lett. 46(4): 414-417 (2018) - Yossi Azar, Sarel Cohen:
An improved algorithm for online machine minimization. Oper. Res. Lett. 46(1): 128-133 (2018) - Haris Aziz:
An impossibility result for housing markets with fractional endowments. Oper. Res. Lett. 46(5): 473-475 (2018) - Yonit Barron:
An order-revenue inventory model with returns and sudden obsolescence. Oper. Res. Lett. 46(1): 88-92 (2018) - Güzin Bayraksan:
An improved averaged two-replication procedure with Latin hypercube sampling. Oper. Res. Lett. 46(2): 173-178 (2018) - Roger Behling, José Yunier Bello Cruz, Luiz-Rafael Santos:
On the linear convergence of the circumcentered-reflection method. Oper. Res. Lett. 46(2): 159-162 (2018) - Walid Ben-Ameur, Mohamed Didi Biha:
A note on the problem of r disjoint (s, t)-cuts and some related issues. Oper. Res. Lett. 46(3): 335-338 (2018) - Glaydston de Carvalho Bento, Orizon P. Ferreira, Yuri Rafael Leite Pereira:
Proximal point method for vector optimization on Hadamard manifolds. Oper. Res. Lett. 46(1): 13-18 (2018) - Pim van den Bogaerdt, Mathijs de Weerdt:
Multi-machine scheduling lower bounds using decision diagrams. Oper. Res. Lett. 46(6): 616-621 (2018) - Mousaab Bouafia, Djamel Benterki, Adnan Yassine:
A new efficient short-step projective interior point method for linear programming. Oper. Res. Lett. 46(3): 291-294 (2018) - Teobaldo Bulhões, Artur Alves Pessoa, Fábio Protti, Eduardo Uchoa:
On the complete set packing and set partitioning polytopes: Properties and rank 1 facets. Oper. Res. Lett. 46(4): 389-392 (2018) - Andrea Caliciotti, Giovanni Fasano, Stephen G. Nash, Massimo Roma:
An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization. Oper. Res. Lett. 46(1): 7-12 (2018) - Margarida Carvalho, Andrea Lodi, Patrice Marcotte:
A polynomial algorithm for a continuous bilevel knapsack problem. Oper. Res. Lett. 46(2): 185-188 (2018) - Wenbo Chen, Ming Dong:
Optimal resource allocation across related channels. Oper. Res. Lett. 46(4): 397-401 (2018) - Xi Chen, Yining Wang:
A note on a tight lower bound for capacitated MNL-bandit assortment selection models. Oper. Res. Lett. 46(5): 534-537 (2018) - Mei Choi Chiu, Hoi Ying Wong:
Robust dynamic pairs trading with cointegration. Oper. Res. Lett. 46(2): 225-232 (2018) - Gérard Cornuéjols, Yanjun Li:
When the Gomory-Chvátal closure coincides with the integer hull. Oper. Res. Lett. 46(2): 251-256 (2018) - Ryan Cory-Wright, Andy Philpott, Golbon Zakeri:
Payment mechanisms for electricity markets with uncertain supply. Oper. Res. Lett. 46(1): 116-121 (2018) - John Edwin Cotrina, Javier Zúñiga:
A note on quasi-equilibrium problems. Oper. Res. Lett. 46(1): 138-140 (2018) - Bertrand Crettez, Naïla Hayek, Georges Zaccour:
Existence and uniqueness of optimal dynamic pricing and advertising controls without concavity. Oper. Res. Lett. 46(2): 199-204 (2018) - Zhenyu Cui, Qi Feng, Ruimeng Hu, Bin Zou:
Systemic risk and optimal fee for central clearing counterparty under partial netting. Oper. Res. Lett. 46(3): 306-311 (2018) - Rui Dai, Hadi Charkhgard:
A two-stage approach for bi-objective integer linear programming. Oper. Res. Lett. 46(1): 81-87 (2018) - Boris Defourny:
Optimality of an affine intensity policy for maximizing the probability of an arrival count in point-process intensity control. Oper. Res. Lett. 46(1): 51-55 (2018) - Sascha Desmettre, Sarah Grün, Ralf Korn:
Portfolio optimization with early announced discrete dividends. Oper. Res. Lett. 46(5): 548-552 (2018) - Santanu S. Dey, Andres Iroume, Guanyi Wang:
The strength of multi-row aggregation cuts for sign-pattern integer programs. Oper. Res. Lett. 46(6): 611-615 (2018) - Weiyong Ding, Yiying Zhang:
Relative ageing of series and parallel systems: Effects of dependence and heterogeneity among components. Oper. Res. Lett. 46(2): 219-224 (2018) - Tammy Drezner, Zvi Drezner, Dawit Zerom:
Competitive facility location with random attractiveness. Oper. Res. Lett. 46(3): 312-317 (2018) - Chenhao Du, William L. Cooper, Zizhuo Wang:
Optimal worst-case pricing for a logit demand model with network effects. Oper. Res. Lett. 46(3): 345-351 (2018)
skipping 87 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-04-17 01:46 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