Остановите войну!
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 95 matches
- 2009
- Bernardetta Addis, Werner Schachinger:
Improved bounds for interatomic distance in Morse clusters. Oper. Res. Lett. 37(4): 290-294 (2009) - Agostinho Agra, Luis Eduardo Neves Gouveia, Cristina Requejo:
Extended formulations for the cardinality constrained subtree of a tree problem. Oper. Res. Lett. 37(3): 192-196 (2009) - M. Selim Akturk, Alper Atamtürk, Sinan Gurel:
A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Oper. Res. Lett. 37(3): 187-191 (2009) - David J. Aldous, Colin McDiarmid, Alex D. Scott:
Uniform multicommodity flow through the complete graph with random edge-capacities. Oper. Res. Lett. 37(5): 299-302 (2009) - Nicola Apollonio, Massimiliano Caramia:
A superclass of Edge-Path-Tree graphs with few cliques. Oper. Res. Lett. 37(5): 351-355 (2009) - David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun:
Certification of an optimal TSP tour through 85, 900 cities. Oper. Res. Lett. 37(1): 11-15 (2009) - Derek R. Atkins, Xuan Zhao:
On the modeling of demand spill for a stochastic demand system under competition. Oper. Res. Lett. 37(4): 269-272 (2009) - Pasquale Avella, Maurizio Boccia, Igor Vasil'ev:
Computational experience with general cutting planes for the Set Covering problem. Oper. Res. Lett. 37(1): 16-20 (2009) - Seray Aydin, Yalçin Akçay, Fikri Karaesmen:
On the structural properties of a discrete-time single product revenue management problem. Oper. Res. Lett. 37(4): 273-279 (2009) - Arnab Basu, Mrinal K. Ghosh:
Asymptotic analysis of option pricing in a Markov modulated market. Oper. Res. Lett. 37(6): 415-419 (2009) - MohammadHossein Bateni, Mohammad Taghi Hajiaghayi:
A note on the subadditive network design problem. Oper. Res. Lett. 37(5): 339-344 (2009) - Demet Batur, David Goldsman, Seong-Hee Kim:
An improved standardized time series Durbin-Watson variance estimator for steady-state simulation. Oper. Res. Lett. 37(4): 285-289 (2009) - Joanna Bauer, Dag Haugland, Di Yuan:
A fast local search method for minimum energy broadcast in wireless ad hoc networks. Oper. Res. Lett. 37(2): 75-79 (2009) - Amir Beck, Aharon Ben-Tal:
Duality in robust optimization: Primal worst equals dual best. Oper. Res. Lett. 37(1): 1-6 (2009) - József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt:
Improved analysis of an algorithm for the coupled task problem with UET jobs. Oper. Res. Lett. 37(2): 93-96 (2009) - Alain Bensoussan, Anshuman Chutani, Suresh P. Sethi:
Optimal cash management under uncertainty. Oper. Res. Lett. 37(6): 425-429 (2009) - Gerardo Berbeglia:
The counting complexity of a simple scheduling problem. Oper. Res. Lett. 37(5): 365-367 (2009) - Attila Bernáth, Tamás Király:
Covering skew-supermodular functions by hypergraphs of minimum total size. Oper. Res. Lett. 37(5): 345-350 (2009) - Markus Bläser, L. Shankar Ram, Maxim Sviridenko:
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems. Oper. Res. Lett. 37(3): 176-180 (2009) - Luce Brotcorne, Saïd Hanafi, Raïd Mansi:
A dynamic programming algorithm for the bilevel knapsack problem. Oper. Res. Lett. 37(3): 215-218 (2009) - Ning Cai:
On first passage times of a hyper-exponential jump diffusion process. Oper. Res. Lett. 37(2): 127-134 (2009) - Ning Cai, Nan Chen, Xiangwei Wan:
Pricing double-barrier options under a flexible jump diffusion model. Oper. Res. Lett. 37(3): 163-167 (2009) - Manoel B. Campêlo, Gérard Cornuéjols:
Stable sets, corner polyhedra and the Chvátal closure. Oper. Res. Lett. 37(6): 375-378 (2009) - Yair Carmon, Adam Shwartz:
Markov decision processes with exponentially representable discounting. Oper. Res. Lett. 37(1): 51-55 (2009) - Jonathan P. Caulkins, Gustav Feichtinger, Dieter Grass, Gernot Tragler:
Optimal control of terrorism and global reputation: A case study with novel threshold behavior. Oper. Res. Lett. 37(6): 387-391 (2009) - Deeparnab Chakrabarty, Nikhil R. Devanur:
On competitiveness in uniform utility allocation markets. Oper. Res. Lett. 37(3): 155-158 (2009) - Ying-Ju Chen:
Monotonicity in the stock competition game with consumer search. Oper. Res. Lett. 37(6): 430-432 (2009) - Christian H. Christiansen, Jens Lysgaard, Sanne Wøhlk:
A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands. Oper. Res. Lett. 37(6): 392-398 (2009) - Michele Conforti, Giacomo Zambelli:
The mixing set with divisible capacities: A simple approach. Oper. Res. Lett. 37(6): 379-383 (2009) - Emilie Danna, David L. Woodruff:
How to select a small set of diverse solutions to mixed integer programming problems. Oper. Res. Lett. 37(4): 255-260 (2009)
skipping 65 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-08 14:20 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