Остановите войну!
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 56 matches
- 2002
- Alexander A. Ageev:
Improved approximation algorithms for multilevel facility location problems. Oper. Res. Lett. 30(5): 327-332 (2002) - Ravindra K. Ahuja, James B. Orlin, Prabha Sharma, P. T. Sokkalingam:
A network simplex algorithm with O(n) consecutive degenerate pivots. Oper. Res. Lett. 30(3): 141-148 (2002) - Jesus R. Artalejo:
A note on the optimality of the N- and D-policies for the M/G/1 queue. Oper. Res. Lett. 30(6): 375-376 (2002) - Kenneth R. Baker, Michael J. Magazine, George G. Polak:
Optimal block design models for course timetabling. Oper. Res. Lett. 30(1): 1-8 (2002) - Earl R. Barnes, Victoria Chen, Balaji Gopalakrishnan, Ellis L. Johnson:
A least-squares primal-dual algorithm for solving linear programming problems. Oper. Res. Lett. 30(5): 289-294 (2002) - Félix Belzunce, Rosa E. Lillo, Franco Pellerey, Moshe Shaked:
Preservation of association in multivariate shock and claim models. Oper. Res. Lett. 30(4): 223-230 (2002) - Gustavo Bergantiños, Estela Sánchez:
NTU PERT games. Oper. Res. Lett. 30(2): 130-140 (2002) - Alain Billionnet:
Approximation algorithms for fractional knapsack problems. Oper. Res. Lett. 30(5): 336-342 (2002) - J. P. C. Blanc:
On the numerical inversion of busy-period related transforms. Oper. Res. Lett. 30(1): 33-42 (2002) - A. Brown, A. Gedlaman, A. Holder, S. Martinez:
An extension of the fundamental theorem of linear programming. Oper. Res. Lett. 30(5): 281-288 (2002) - Robert D. Carr, Giuseppe Lancia:
Compact vs. exponential-size LP relaxations. Oper. Res. Lett. 30(1): 57-65 (2002) - Mohan L. Chaudhry, Bong K. Yoon, Kyung C. Chae:
Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system. Oper. Res. Lett. 30(3): 174-180 (2002) - Doo-Hyun Choi:
Cooperative mutation based evolutionary programming for continuous function optimization. Oper. Res. Lett. 30(3): 195-201 (2002) - Albert Corominas:
A remark about "A comment on consecutive-2-out-of-n systems". Oper. Res. Lett. 30(1): 69-70 (2002) - Leah Epstein, Lene M. Favrholdt:
Optimal preemptive semi-online scheduling to minimize makespan on two related machines. Oper. Res. Lett. 30(4): 269-275 (2002) - Leah Epstein, John Noga, Gerhard J. Woeginger:
On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Oper. Res. Lett. 30(6): 415-420 (2002) - Dieter Fiems, Herwig Bruneel:
A note on the discretization of Little's result. Oper. Res. Lett. 30(1): 17-18 (2002) - Jerzy A. Filar, Eitan Altman, Konstantin Avrachenkov:
An asymptotic simplex method for singularly perturbed linear programs. Oper. Res. Lett. 30(5): 295-307 (2002) - Robert D. Foley, Byung Chun Park:
Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers. Oper. Res. Lett. 30(1): 19-24 (2002) - Virginie Gabrel, Michel Minoux:
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems. Oper. Res. Lett. 30(4): 252-264 (2002) - Antonio Gómez-Corral:
A matrix-geometric approximation for tandem queues with blocking and repeated attempts. Oper. Res. Lett. 30(6): 360-374 (2002) - Yongpei Guan, Wen-Qiang Xiao, Raymond K. Cheung, Chung-Lun Li:
A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis. Oper. Res. Lett. 30(5): 343-350 (2002) - Gregory Z. Gutin, Anders Yeo:
Anti-matroids. Oper. Res. Lett. 30(2): 97-99 (2002) - Zhenghai Huang:
Sufficient conditions on nonemptiness and boundedness of the solution set of the P0 function nonlinear complementarity problem. Oper. Res. Lett. 30(3): 202-210 (2002) - Brady Hunsaker, Martin W. P. Savelsbergh:
Efficient feasibility testing for dial-a-ride problems. Oper. Res. Lett. 30(3): 169-173 (2002) - Wooseung Jang, Cerry M. Klein:
Minimizing the expected number of tardy jobs when processing times are normally distributed. Oper. Res. Lett. 30(2): 100-106 (2002) - Jianyong Liu:
Notes on average Markov decision processes with a minimum-variance criterion. Oper. Res. Lett. 30(2): 107-116 (2002) - Jörg Kalcsics, Stefan Nickel, Justo Puerto, Arie Tamir:
Algorithmic results for ordered median problems. Oper. Res. Lett. 30(3): 149-158 (2002) - Hervé Kerivin, Ali Ridha Mahjoub:
Separation of partition inequalities for the (1, 2)-survivable network design problem. Oper. Res. Lett. 30(4): 265-268 (2002) - Nam K. Kim, Seok Ho Chang, Kyung C. Chae:
On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals. Oper. Res. Lett. 30(1): 25-32 (2002)
skipping 26 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-08-21 07: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