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 25 matches
- 2021
- Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý:
On packet scheduling with adversarial jamming and speedup. Ann. Oper. Res. 298(1): 7-42 (2021) - Xiaoqiang Cai, Xianyi Wu, Xian Zhou:
Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns. Ann. Oper. Res. 298(1): 43-64 (2021) - Francesco Carrabs, Raffaele Cerulli, Rosa Pentangelo, Andrea Raiconi:
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach. Ann. Oper. Res. 298(1): 65-78 (2021) - Xing Chai, Wenhua Li, Yuejuan Zhu:
Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine. Ann. Oper. Res. 298(1): 79-93 (2021) - T. C. E. Cheng, Boris Kriheli, Eugene Levner, C. T. Ng:
Scheduling an autonomous robot searching for hidden targets. Ann. Oper. Res. 298(1): 95-109 (2021) - Philippe Chrétienne:
Reactive and proactive single-machine scheduling to maintain a maximum number of starting times. Ann. Oper. Res. 298(1): 111-124 (2021) - Isma Dahmani, Mhand Hifi:
A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs. Ann. Oper. Res. 298(1): 125-147 (2021) - Gustavo Dias, Leo Liberti:
Exploiting symmetries in mathematical programming via orbital independence. Ann. Oper. Res. 298(1): 149-182 (2021) - Sourour Elloumi, Olivier Hudry, Estel Marie, Agathe Martin, Agnès Plateau, Stéphane Rovedakis:
Optimization of wireless sensor networks deployment with coverage and connectivity constraints. Ann. Oper. Res. 298(1): 183-206 (2021) - Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger:
The transportation problem with conflicts. Ann. Oper. Res. 298(1): 207-227 (2021) - Hüseyin Güden:
New complexity results for the p-hub median problem. Ann. Oper. Res. 298(1): 229-247 (2021) - Nicholas G. Hall, Marc E. Posner, Chris N. Potts:
Online production planning to maximize the number of on-time orders. Ann. Oper. Res. 298(1): 249-269 (2021) - Danny Hermelin, Shlomo Karhi, Michael L. Pinedo, Dvir Shabtay:
New algorithms for minimizing the weighted number of tardy jobs on a single machine. Ann. Oper. Res. 298(1): 271-287 (2021) - Mahmoud Heshmat, Amr B. Eltawil:
Solving operational problems in outpatient chemotherapy clinics using mathematical programming and simulation. Ann. Oper. Res. 298(1): 289-306 (2021) - Guoxuan Huang, Qing Ding, Ciwei Dong, Zhicong Pan:
Joint optimization of pricing and inventory control for dual-channel problem under stochastic demand. Ann. Oper. Res. 298(1): 307-337 (2021) - Imed Kacem, Hans Kellerer, Ali Ridha Mahjoub:
Preface: New trends on combinatorial optimization for network and logistical applications. Ann. Oper. Res. 298(1): 1-5 (2021) - Hyun-Jung Kim, Jun-Ho Lee:
Cyclic robot scheduling for 3D printer-based flexible assembly systems. Ann. Oper. Res. 298(1): 339-359 (2021) - Lingfa Lu, Liqi Zhang, Jinwen Ou:
In-house production and outsourcing under different discount schemes on the total outsourcing cost. Ann. Oper. Res. 298(1): 361-374 (2021) - Mohamed Amine Mkadem, Aziz Moukrim, Mehdi Serairi:
Exact method for the two-machine flow-shop problem with time delays. Ann. Oper. Res. 298(1): 375-406 (2021) - Jun Pei, Qingru Song, Baoyu Liao, Xinbao Liu, Panos M. Pardalos:
Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration. Ann. Oper. Res. 298(1): 407-444 (2021) - Alain Quilliot, Antoine Sarbinowski, Hélène Toussaint:
Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system. Ann. Oper. Res. 298(1): 445-468 (2021) - Alan J. Soper, Vitaly A. Strusevich:
Parametric analysis of the quality of single preemption schedules on three uniform parallel machines. Ann. Oper. Res. 298(1): 469-495 (2021) - Ya Xu, Yuquan Du, Yongjian Li, Heng Zhang:
Collaborative emergency berth scheduling based on decentralized decision and price mechanism. Ann. Oper. Res. 298(1): 525-554 (2021) - Yunqiang Yin, Doudou Li, Dujuan Wang, T. C. E. Cheng:
Single-machine serial-batch delivery scheduling with two competing agents and due date assignment. Ann. Oper. Res. 298(1): 497-523 (2021) - Gabriel L. Zenarosa, Oleg A. Prokopyev, Eduardo L. Pasiliao:
On exact solution approaches for bilevel quadratic 0-1 knapsack problem. Ann. Oper. Res. 298(1): 555-572 (2021)
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 2025-01-16 00:22 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