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 21 matches
- 2019
- Filipe Pereira Alvelos, Xenia Klimentova, Ana Viana:
Maximizing the expected number of transplants in kidney exchange programs with branch-and-price. Ann. Oper. Res. 272(1-2): 429-444 (2019) - Nader Azizi:
Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods. Ann. Oper. Res. 272(1-2): 159-185 (2019) - Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Solving the capacitated clustering problem with variable neighborhood search. Ann. Oper. Res. 272(1-2): 289-321 (2019) - Kuei-Hu Chang:
A novel supplier selection method that integrates the intuitionistic fuzzy weighted averaging method and a soft set with imprecise data. Ann. Oper. Res. 272(1-2): 139-157 (2019) - Abdelahad Chraibi, Ibrahim H. Osman, Said Kharraja:
Adaptive layout for operating theatre in hospitals: different mathematical models for optimal layouts. Ann. Oper. Res. 272(1-2): 493-527 (2019) - Soheil Davari:
The incremental cooperative design of preventive healthcare networks. Ann. Oper. Res. 272(1-2): 445-492 (2019) - Houda Derbel, Bassem Jarboui, Rim Bhiri:
A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem. Ann. Oper. Res. 272(1-2): 243-272 (2019) - Dusan Dzamic, Daniel Aloise, Nenad Mladenovic:
Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization. Ann. Oper. Res. 272(1-2): 273-287 (2019) - Chandra Ade Irawan, Dylan F. Jones:
Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities. Ann. Oper. Res. 272(1-2): 41-67 (2019) - Salman Khodayifar, Mohammad Ali Raayatpanah, Panos M. Pardalos:
A polynomial time algorithm for the minimum flow problem in time-varying networks. Ann. Oper. Res. 272(1-2): 29-39 (2019) - Ramez Kian, Tolga Bektas, Djamila Ouelhadj:
Optimal spare parts management for vessel maintenance scheduling. Ann. Oper. Res. 272(1-2): 323-353 (2019) - Arne Klein, Dag Haugland:
Obstacle-aware optimization of offshore wind farm cable layouts. Ann. Oper. Res. 272(1-2): 373-388 (2019) - Frederik Knust, Lin Xie:
Simulated annealing approach to nurse rostering benchmark and real-world instances. Ann. Oper. Res. 272(1-2): 187-216 (2019) - Arie M. C. A. Koster, Robert Scheidweiler, Martin Tieves:
A flow based pruning scheme for enumerative equitable coloring algorithms. Ann. Oper. Res. 272(1-2): 3-28 (2019) - Konstantinos Liagkouras, Konstantinos Metaxiotis:
Improving the performance of evolutionary algorithms: a new approach utilizing information from the evolutionary process and its application to the fuzzy portfolio optimization problem. Ann. Oper. Res. 272(1-2): 119-137 (2019) - Renato E. deMatta:
Product costing in the strategic formation of a supply chain. Ann. Oper. Res. 272(1-2): 389-427 (2019) - Jun Pei, Bayi Cheng, Xinbao Liu, Panos M. Pardalos, Min Kong:
Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Ann. Oper. Res. 272(1-2): 217-241 (2019) - Abdellah Salhi, Ghazwan Alsoufi, Xinan Yang:
An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports. Ann. Oper. Res. 272(1-2): 69-98 (2019) - Saïd Salhi, Richard W. Eglese, Eleni Hadjiconstantinou:
Preface: advances in theoretical and practical combinatorial optimization. Ann. Oper. Res. 272(1-2): 1-2 (2019) - Adibah Shuib, Faiq Izzuddin Kamarudin:
Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model. Ann. Oper. Res. 272(1-2): 355-372 (2019) - M. Hosein Zare, Juan Sebastian Borrero, Bo Zeng, Oleg A. Prokopyev:
A note on linearized reformulations for a class of bilevel linear integer problems. Ann. Oper. Res. 272(1-2): 99-117 (2019)
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-11-07 20:06 CET 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