Остановите войну!
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 119 matches
- 2007
- Warren P. Adams, Richard J. Forrester:
Linear forms of nonlinear expressions: New insights on old ideas. Oper. Res. Lett. 35(4): 510-518 (2007) - Alexander A. Ageev, Alexei E. Baburin:
Approximation algorithms for UET scheduling problems with exact delays. Oper. Res. Lett. 35(4): 533-540 (2007) - O. Zeynep Aksin, Fikri Karaesmen:
Characterizing the performance of process flexibility structures. Oper. Res. Lett. 35(4): 477-484 (2007) - Tûba Aktaran-Kalayci, David Goldsman, James R. Wilson:
Linear combinations of overlapping variance estimators for simulation. Oper. Res. Lett. 35(4): 439-447 (2007) - Alberto Amaya, André Langevin, Martin Trépanier:
The capacitated arc routing problem with refill points. Oper. Res. Lett. 35(1): 45-53 (2007) - Eric Angel, Evripidis Bampis, Aleksei V. Fishkin:
A note on scheduling to meet two min-sum objectives. Oper. Res. Lett. 35(1): 69-73 (2007) - Enrico Angelelli, Martin W. P. Savelsbergh, Maria Grazia Speranza:
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem. Oper. Res. Lett. 35(6): 713-721 (2007) - Gautam Appa, Balázs Kotnyek, Konstantinos Papalamprou, Leonidas S. Pitsoulis:
Optimization with binet matrices. Oper. Res. Lett. 35(3): 345-352 (2007) - David L. Applegate, William J. Cook, Sanjeeb Dash, Daniel G. Espinoza:
Exact solutions to linear programming problems. Oper. Res. Lett. 35(6): 693-699 (2007) - M. Z. Arslanov:
A polynomial algorithm for one problem of guillotine cutting. Oper. Res. Lett. 35(5): 636-644 (2007) - David Avis, Tomokazu Imamura:
A list heuristic for vertex cover. Oper. Res. Lett. 35(2): 201-204 (2007) - Mourad Baïou, Michel Balinski:
Characterizations of the optimal stable allocation mechanism. Oper. Res. Lett. 35(3): 392-402 (2007) - Philippe Baptiste:
Book review. Oper. Res. Lett. 35(1): 139-140 (2007) - Achal Bassamboo, Sandeep Juneja, Assaf Zeevi:
On the inefficiency of state-independent importance sampling in the presence of heavy tails. Oper. Res. Lett. 35(2): 251-260 (2007) - Tal Ben-Zvi, Abraham Grosfeld-Nir:
Serial production systems with random yield and rigid demand: A heuristic. Oper. Res. Lett. 35(2): 235-244 (2007) - Cédric Bentz:
The maximum integer multiterminal flow problem in directed graphs. Oper. Res. Lett. 35(2): 195-200 (2007) - Hans van den Berg, Michel Mandjes, Rudesindo Núñez-Queija:
Pricing and distributed QoS control for elastic network traffic. Oper. Res. Lett. 35(3): 297-307 (2007) - Wojciech Bozejko, Mieczyslaw Wodecki:
On the theoretical properties of swap multimoves. Oper. Res. Lett. 35(2): 227-231 (2007) - David B. Brown:
Large deviations bounds for estimating conditional value-at-risk. Oper. Res. Lett. 35(6): 722-730 (2007) - Rainer E. Burkard, Jafar Fathali, Hossein Taghizadeh Kakhki:
The p-maxian problem on a tree. Oper. Res. Lett. 35(3): 331-335 (2007) - Sergiy Butenko, Svyatoslav Trukhanov:
Using critical sets to solve the maximum independent set problem. Oper. Res. Lett. 35(4): 519-524 (2007) - Jaroslaw Byrka, Karen I. Aardal:
The approximation gap for the metric facility location problem is not yet closed. Oper. Res. Lett. 35(3): 379-384 (2007) - Lázaro Cánovas, Sergio García, Martine Labbé, Alfredo Marín:
A strengthened formulation for the simple plant location problem with order. Oper. Res. Lett. 35(2): 141-150 (2007) - Javier Castro, Daniel Gómez, Juan Tejada:
A project game for PERT networks. Oper. Res. Lett. 35(6): 791-798 (2007) - Kyung C. Chae, Sung J. Kim:
Busy period analysis for the GI/M/1 queue with exponential vacations. Oper. Res. Lett. 35(1): 114-118 (2007) - Kyung C. Chae, Kilhwan Kim, Nam K. Kim:
Remarks on the remaining service time upon reaching a target level in the M/G/1 queue. Oper. Res. Lett. 35(3): 308-310 (2007) - Hyeong Soo Chang:
A policy improvement method for constrained average Markov decision processes. Oper. Res. Lett. 35(4): 434-438 (2007) - Z.-L. Chen, Lei Lei, Hong Zhong:
Container vessel scheduling with bi-directional flows. Oper. Res. Lett. 35(2): 186-194 (2007) - Christian H. Christiansen, Jens Lysgaard:
A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. Lett. 35(6): 773-781 (2007) - François Clautiaux, Jacques Carlier, Aziz Moukrim:
A new exact method for the two-dimensional bin-packing problem with fixed orientation. Oper. Res. Lett. 35(3): 357-364 (2007)
skipping 89 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-06-30 20:13 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