


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.
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 122 matches
- 2010
- Lauri Ahlroth, André Schumacher, Harri Haanpää:
On the power of lookahead in online lot-sizing. Oper. Res. Lett. 38(6): 522-526 (2010) - Douglas S. Altner, Özlem Ergun, Nelson A. Uhan:
The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability. Oper. Res. Lett. 38(1): 33-38 (2010) - Alireza Asadi, Guoyong Gu, Cornelis Roos:
Convergence of the homotopy path for a full-Newton step infeasible interior-point method. Oper. Res. Lett. 38(2): 147-151 (2010) - Amir Beck, Aharon Ben-Tal, Nili Guttmann-Beck, Luba Tetruashvili:
The CoMirror algorithm for solving nonsmooth constrained convex problems. Oper. Res. Lett. 38(6): 493-498 (2010) - Saif Benjaafar, Jean-Philippe Gayon, Seda Tepe:
Optimal control of a production-inventory system with customer impatience. Oper. Res. Lett. 38(4): 267-272 (2010) - Lakdere Benkherouf, Suresh P. Sethi:
Optimality of (s, S) policies for a stochastic inventory model with proportional and lump-sum shortage costs. Oper. Res. Lett. 38(4): 252-255 (2010) - Gustavo Bergantiños
, Leticia Lorenzo
, Silvia Lorenzo-Freire
:
A characterization of the proportional rule in multi-issue allocation situations. Oper. Res. Lett. 38(1): 17-19 (2010) - Vivek S. Borkar, Mrinal K. Ghosh, Govindan Rangarajan:
Application of nonlinear filtering to credit risk. Oper. Res. Lett. 38(6): 527-532 (2010) - Valentina Cacchiani
, Alberto Caprara, Paolo Toth:
Non-cyclic train timetabling and comparability graphs. Oper. Res. Lett. 38(3): 179-184 (2010) - Riccardo Cambini
, Francesca Salvi:
Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience. Oper. Res. Lett. 38(5): 354-357 (2010) - Jordi Castro, Jordi Cuesta:
Existence, uniqueness, and convergence of the regularized primal-dual central path. Oper. Res. Lett. 38(5): 366-371 (2010) - Ji Hwan Cha, Eui Yong Lee:
An extended stochastic failure model for a system subject to random shocks. Oper. Res. Lett. 38(5): 468-473 (2010) - Deeparnab Chakrabarty, Jochen Könemann, David Pritchard:
Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound. Oper. Res. Lett. 38(6): 567-570 (2010) - Doron Chen, Reuven Chen:
A relaxation-based algorithm for solving the conditional p-center problem. Oper. Res. Lett. 38(3): 215-217 (2010) - Shaoxiang Chen
, Jianjun Xu:
Note on the optimality of (s, S) policies for inventory systems with two demand classes. Oper. Res. Lett. 38(5): 450-453 (2010) - Zhiyuan Chen, Yi Yang:
Optimality of (s, S, p) policy in a general inventory-pricing model with uniform demands. Oper. Res. Lett. 38(4): 256-260 (2010) - Rachel R. Chen
, Shuya Yin:
The equivalence of uniform and Shapley value-based cost allocations in a specific game. Oper. Res. Lett. 38(6): 539-544 (2010) - Kevin K. H. Cheung, Kyle Harvey:
Revisiting a simple algorithm for the planar multiterminal cut problem. Oper. Res. Lett. 38(4): 334-336 (2010) - Arunachalam Chockalingam, Kumar Muthuraman:
Pricing American options when asset prices jump. Oper. Res. Lett. 38(2): 82-86 (2010) - Byung-Cheon Choi
, Joseph Y.-T. Leung, Michael L. Pinedo:
Complexity of a scheduling problem with controllable processing times. Oper. Res. Lett. 38(2): 123-126 (2010) - Eduardo Conde
:
A 2-approximation for minmax regret problems via a mid-point scenario optimal solution. Oper. Res. Lett. 38(4): 326-327 (2010) - Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
:
Equivalence between intersection cuts and the corner polyhedron. Oper. Res. Lett. 38(3): 153-155 (2010) - Stefan Creemers
, Roel Leus
, Marc Lambrecht:
Scheduling Markovian PERT networks to maximize the net present value. Oper. Res. Lett. 38(1): 51-56 (2010) - Federico Della Croce
, Vincent T'kindt
:
Improving the preemptive bound for the single machine dynamic maximum lateness problem. Oper. Res. Lett. 38(6): 589-591 (2010) - Jean-Pierre Crouzeix, Eladio Ocaña Anaya
:
Monotone and maximal monotone affine subspaces. Oper. Res. Lett. 38(2): 139-142 (2010) - Claudia D'Ambrosio
, Antonio Frangioni
, Leo Liberti
, Andrea Lodi:
On interval-subgradient and no-good cuts. Oper. Res. Lett. 38(5): 341-345 (2010) - Claudia D'Ambrosio
, Andrea Lodi, Silvano Martello:
Piecewise linear approximation of functions of two variables in MILP models. Oper. Res. Lett. 38(1): 39-46 (2010) - Sanjeeb Dash:
On the complexity of cutting-plane proofs using split cuts. Oper. Res. Lett. 38(2): 109-114 (2010) - Thomas Eichner, Andreas Wagener:
Beneficial changes in dependence structures and two-moment decision models. Oper. Res. Lett. 38(3): 227-230 (2010) - Martin Eling, Luisa Tibiletti
:
Internal vs. external risk measures: How capital requirements differ in practice. Oper. Res. Lett. 38(5): 482-488 (2010)
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.
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.
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.
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 2025-07-27 15:54 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
