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 27 matches
- 2011
- I. Kuban Altinel, Bora Çekyay, Orhan Feyzioglu, Muhammed Emre Keskin, Süleyman Özekici:
Mission-Based Component Testing for Series Systems. Ann. Oper. Res. 186(1): 1-22 (2011) - Michael J. Armstrong:
A verification study of the stochastic salvo combat model. Ann. Oper. Res. 186(1): 23-38 (2011) - Jan-Hendrik Bartels, Thorsten Gather, Jürgen Zimmermann:
Dismantling of nuclear power plants at optimal NPV. Ann. Oper. Res. 186(1): 407-427 (2011) - Illana Bendavid, Boaz Golany:
Predetermined intervals for start times of activities in the stochastic project scheduling problem. Ann. Oper. Res. 186(1): 429-442 (2011) - Vicki M. Bier, Kjell Hausken:
Endogenizing the sticks and carrots: modeling possible perverse effects of counterterrorism measures. Ann. Oper. Res. 186(1): 39-59 (2011) - Ann Melissa Campbell, Michel Gendreau, Barrett W. Thomas:
The orienteering problem with stochastic travel and service times. Ann. Oper. Res. 186(1): 61-81 (2011) - István Deák:
Testing successive regression approximations by large-scale two-stage problems. Ann. Oper. Res. 186(1): 83-99 (2011) - Pooya Farahvash, Tayfur Altiok:
A multi-period inventory model with multi-dimensional procurement bidding. Ann. Oper. Res. 186(1): 101-118 (2011) - Balaji Gopalakrishnan, Seunghyun Kong, Earl R. Barnes, Ellis L. Johnson, Joel S. Sokol:
A least-squares minimum-cost network flow algorithm. Ann. Oper. Res. 186(1): 119-140 (2011) - Willy Herroelen, Javier Pajares, Adolfo López-Paredes:
Foreword. Ann. Oper. Res. 186(1): 393-394 (2011) - Ching-Chung Kuo:
Optimal assignment of resources to strengthen the weakest link in an uncertain environment. Ann. Oper. Res. 186(1): 159-173 (2011) - Olivier Lambrechts, Erik Demeulemeester, Willy Herroelen:
Time slack-based techniques for robust project scheduling subject to resource uncertainty. Ann. Oper. Res. 186(1): 443-464 (2011) - Giuseppe Lancia, Franca Rinaldi, Paolo Serafini:
A time-indexed LP-based approach for min-sum job-shop problems. Ann. Oper. Res. 186(1): 175-198 (2011) - Pierre Lemaire:
Extensions of Logical Analysis of Data for growth hormone deficiency diagnoses. Ann. Oper. Res. 186(1): 199-211 (2011) - Shu-Hsien Liao, Chia-Lin Hsieh, Yu-Siang Lin:
A multi-objective evolutionary optimization approach for an integrated location-inventory distribution network problem under vendor-managed inventory systems. Ann. Oper. Res. 186(1): 213-229 (2011) - Manuel Castejón Limas, Joaquín B. Ordieres Meré, Ana González-Marcos, Víctor González-Castro:
Effort estimates through project complexity. Ann. Oper. Res. 186(1): 395-406 (2011) - Bo Liu, Ling Wang, Ying Liu, Shouyang Wang:
A unified framework for population-based metaheuristics. Ann. Oper. Res. 186(1): 231-262 (2011) - José Ignacio Muñoz, Javier Contreras, J. Caamaño, P. F. Correia:
A decision-making tool for project investments based on real options: the case of wind power generation. Ann. Oper. Res. 186(1): 465-490 (2011) - Miklós Pintér:
Regression games. Ann. Oper. Res. 186(1): 263-274 (2011) - Daniel Cosmin Porumbel, Jin-Kao Hao, Fred W. Glover:
A simple and effective algorithm for the MaxMin diversity problem. Ann. Oper. Res. 186(1): 275-293 (2011) - Nima Safaei, Dragan Banjevic, Andrew K. S. Jardine:
Workforce-constrained maintenance scheduling for military aircraft fleet: a case study. Ann. Oper. Res. 186(1): 295-316 (2011) - Ümit Sami Sakalli, Ömer Faruk Baykoç, Burak Birgören:
Stochastic optimization for blending problem in brass casting industry. Ann. Oper. Res. 186(1): 141-157 (2011) - Shey-Huei Sheu, Chin-Chih Chang, Yu-Hung Chien:
Optimal age-replacement time with minimal repair based on cumulative repair-cost limit for a system subject to shocks. Ann. Oper. Res. 186(1): 317-329 (2011) - Wenyu Sun, Chengjin Li, Raimundo J. B. de Sampaio:
On duality theory for non-convex semidefinite programming. Ann. Oper. Res. 186(1): 331-343 (2011) - Desheng Dash Wu, Zhaoxin Zhou, John R. Birge:
Estimation of potential gains from mergers in multiple periods: a comparison of stochastic frontier analysis and Data Envelopment Analysis. Ann. Oper. Res. 186(1): 357-381 (2011) - Kailiang Xu, Zuren Feng, Liangjun Ke:
Single machine scheduling with total tardiness criterion and convex controllable processing times. Ann. Oper. Res. 186(1): 383-391 (2011) - Xingong Zhang, Guangle Yan, Wanzhen Huang, Guochun Tang:
Single-machine scheduling problems with time and position dependent processing times. Ann. Oper. Res. 186(1): 345-356 (2011)
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-02 18:25 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