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 126 matches
- 2015
- David Adjiashvili, Sandro Bosio, Kevin Zemmer:
Minimizing the number of switch instances on a flexible machine in polynomial time. Oper. Res. Lett. 43(3): 317-322 (2015) - Shabbir Ahmed:
Corrigendum to "A scenario decomposition algorithm for 0-1 stochastic programs" [Oper. Res. Lett. 41(6) (2013) 565-569]. Oper. Res. Lett. 43(2): 215-217 (2015) - Ahsan-Abbas Ali, Shuangqing Wei, Lijun Qian:
Optimal admission and preemption control in finite-source loss systems. Oper. Res. Lett. 43(3): 241-246 (2015) - Iskander Aliev:
On the lattice programming gap of the group problems. Oper. Res. Lett. 43(2): 199-202 (2015) - Haris Aziz:
Competitive equilibrium with equal incomes for allocation of indivisible objects. Oper. Res. Lett. 43(6): 622-624 (2015) - Javiera Barrera, Héctor Cancela, Eduardo Moreno:
Topological optimization of reliable networks under dependent failures. Oper. Res. Lett. 43(2): 132-136 (2015) - Cristina Bazgan, Florian Jamain, Daniel Vanderpooten:
Approximate Pareto sets of minimal size for multi-objective optimization problems. Oper. Res. Lett. 43(1): 1-6 (2015) - Sylvain Béal, Eric Rémila, Philippe Solal:
Decomposition of the space of TU-games, Strong transfer invariance and the Banzhaf value. Oper. Res. Lett. 43(2): 123-125 (2015) - Lotte Berghman, Frits C. R. Spieksma:
Valid inequalities for a time-indexed formulation. Oper. Res. Lett. 43(3): 268-272 (2015) - Sebastian Bervoets, Vincent Merlin, Gerhard J. Woeginger:
Vote trading and subset sums. Oper. Res. Lett. 43(1): 99-102 (2015) - Pierre Le Bodic, George L. Nemhauser:
How important are branching decisions: Fooling MIP solvers. Oper. Res. Lett. 43(3): 273-278 (2015) - Judith Brecklinghaus, Stefan Hougardy:
The approximation ratio of the greedy algorithm for the metric traveling salesman problem. Oper. Res. Lett. 43(3): 259-261 (2015) - Christoph Buchheim, Marianna De Santis, Laura Palagi:
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations. Oper. Res. Lett. 43(4): 384-388 (2015) - Alessandra Buratto, Chiara D'Alpaos:
Optimal sustainable use of drinking water sources and interactions between multiple providers. Oper. Res. Lett. 43(4): 389-395 (2015) - Wei Cao, Jian Li, Shimin Li, Haitao Wang:
Balanced splitting on weighted intervals. Oper. Res. Lett. 43(4): 396-400 (2015) - Leunglung Chan, Eckhard Platen:
Pricing volatility derivatives under the modified constant elasticity of variance model. Oper. Res. Lett. 43(4): 419-422 (2015) - Yu-Lin Chang, Jein-Shan Chen, Ching-Yu Yang:
Symmetrization of generalized natural residual function for NCP. Oper. Res. Lett. 43(4): 354-358 (2015) - Ying-Ju Chen:
Optimal dynamic pricing for sponsored search advertising. Oper. Res. Lett. 43(2): 177-182 (2015) - Zhe Chen:
Asymptotic analysis for proximal-type methods in vector variational inequality problems. Oper. Res. Lett. 43(3): 226-230 (2015) - Po-An Chen:
How egalitarian are Nash equilibria in network cost-sharing games? Oper. Res. Lett. 43(6): 564-566 (2015) - Xin Chen, Xiangyu Gao, Zhenyu Hu:
A new approach to two-location joint inventory and transshipment control via L♮-convexity. Oper. Res. Lett. 43(1): 65-68 (2015) - Geoffrey A. Chua, Yan Liu:
On the effect of demand randomness on inventory, pricing and profit. Oper. Res. Lett. 43(5): 514-518 (2015) - Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge:
Subgraph polytopes and independence polytopes of count matroids. Oper. Res. Lett. 43(5): 457-460 (2015) - Fabien Cornillier, Vincent Charles:
Measuring the attractiveness of academic journals: A direct influence aggregation model. Oper. Res. Lett. 43(2): 172-176 (2015) - Bernardo D'Auria, Spyridoula Kanta:
Pure threshold strategies for a two-node tandem network under partial information. Oper. Res. Lett. 43(5): 467-470 (2015) - James M. Davis, Huseyin Topaloglu, David P. Williamson:
Assortment optimization over time. Oper. Res. Lett. 43(6): 608-611 (2015) - Sina Dehghani, MohammadAmin Fazli, Jafar Habibi, Sadra Yazdanbod:
Using shortcut edges to maximize the number of triangles in graphs. Oper. Res. Lett. 43(6): 586-591 (2015) - Santanu S. Dey, Andres Iroume, Marco Molinaro:
Some lower bounds on sparse outer approximations of polytopes. Oper. Res. Lett. 43(3): 323-328 (2015) - Santanu Dey, Sandeep Juneja, Karthyek R. A. Murthy:
Incorporating views on marginal distributions in the calibration of risk models. Oper. Res. Lett. 43(1): 46-51 (2015) - Yoel Drori, Shoham Sabach, Marc Teboulle:
A simple algorithm for a class of nonsmooth convex-concave saddle-point problems. Oper. Res. Lett. 43(2): 209-214 (2015)
skipping 96 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-10-19 16:02 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