Остановите войну!
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
- 2004
- Attahiru Sule Alfa:
Loss probability in an overloaded discrete-time GI/G/1/K system with very large K. Oper. Res. Lett. 32(5): 439-447 (2004) - Gautam Appa, Dimitris Magos, Ioannis Mourtos:
An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6. Oper. Res. Lett. 32(4): 336-344 (2004) - Ionut D. Aron, Pascal Van Hentenryck:
On the complexity of the robust spanning tree problem with interval data. Oper. Res. Lett. 32(1): 36-40 (2004) - Igor Averbakh:
Minmax regret linear resource allocation problems. Oper. Res. Lett. 32(2): 174-180 (2004) - Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania:
Preemptive scheduling of equal-length jobs to maximize weighted throughput. Oper. Res. Lett. 32(3): 258-264 (2004) - Reuven Bar-Yehuda, Dror Rawitz:
Local ratio with negative weights. Oper. Res. Lett. 32(6): 540-546 (2004) - John J. Bartholdi III, Paul Goldsman:
The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle. Oper. Res. Lett. 32(4): 304-308 (2004) - Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic, Dan Rubenstein:
Flood search under the California Split rule. Oper. Res. Lett. 32(3): 199-206 (2004) - Dimitris Bertsimas, Dessislava Pachamanova, Melvyn Sim:
Robust linear optimization under general norms. Oper. Res. Lett. 32(6): 510-516 (2004) - Robert P. Bosch Jr., Adrianne Herman:
Continuous line drawings via the traveling salesman problem. Oper. Res. Lett. 32(4): 302-303 (2004) - Jesper Makholm Byskov:
Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett. 32(6): 547-556 (2004) - Herminia I. Calvete, Carmen Galé:
Solving linear fractional bilevel programs. Oper. Res. Lett. 32(2): 143-151 (2004) - Alberto Caprara:
Book reviews. Oper. Res. Lett. 32(5): 496-497 (2004) - Alberto Caprara, Michele Monaci:
On the two-dimensional Knapsack Problem. Oper. Res. Lett. 32(1): 5-14 (2004) - Alberto Caprara, Ulrich Pferschy:
Worst-case analysis of the subset sum algorithm for bin packing. Oper. Res. Lett. 32(2): 159-166 (2004) - I. T. Castro, E. L. Sanjuán:
Power processes and their application to reliability. Oper. Res. Lett. 32(5): 415-421 (2004) - Wanpracha Art Chaovalitwongse, Panos M. Pardalos, Oleg A. Prokopyev:
A new linearization technique for multi-quadratic 0-1 programming problems. Oper. Res. Lett. 32(6): 517-522 (2004) - Mohan L. Chaudhry, Seok Ho Chang:
Analysis of the discrete-time bulk-service queue Geo/GY/1/N+B. Oper. Res. Lett. 32(4): 355-363 (2004) - Eddie Cheng, Sven de Vries:
Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. Oper. Res. Lett. 32(2): 181-184 (2004) - Bong Dae Choi, Bara Kim:
Non-ergodicity criteria for denumerable continuous time Markov processes. Oper. Res. Lett. 32(6): 574-580 (2004) - Bong Dae Choi, Bara Kim, Gang Uk Hwang, Jae-kyoon Kim:
The analysis of a multiserver queue fed by a discrete autoregressive process of order 1. Oper. Res. Lett. 32(1): 85-93 (2004) - Geir Dahl, Njål Foldnes, Luis Eduardo Neves Gouveia:
A note on hop-constrained walk polytopes. Oper. Res. Lett. 32(4): 345-349 (2004) - Geir Dahl, Luis Eduardo Neves Gouveia:
On the directed hop-constrained shortest path problem. Oper. Res. Lett. 32(1): 15-22 (2004) - Andreas Ehrenmann:
Manifolds of multi-leader Cournot equilibria. Oper. Res. Lett. 32(2): 121-125 (2004) - Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha:
Min-max tree covers of graphs. Oper. Res. Lett. 32(4): 309-315 (2004) - Tamás Fleiner, András Frank, Satoru Iwata:
A constrained independent set problem for matroids. Oper. Res. Lett. 32(1): 23-26 (2004) - Roland W. Freund, Florian Jarre:
A sensitivity result for semidefinite programs. Oper. Res. Lett. 32(2): 126-132 (2004) - Srinagesh Gavirneni:
Periodic review inventory control with fluctuating purchasing costs. Oper. Res. Lett. 32(4): 374-379 (2004) - Carla P. Gomes, Rommel G. Regis, David B. Shmoys:
An improved approximation algorithm for the partial Latin square extension problem. Oper. Res. Lett. 32(5): 479-484 (2004) - Andrea Grosso, Federico Della Croce, Roberto Tadei:
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Oper. Res. Lett. 32(1): 68-72 (2004)
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-06-02 03:22 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