![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 24 matches
- 2021
- Arjan Akkermans, Gerhard Post
, Marc Uetz:
Solving the shift and break design problem using integer linear programming. Ann. Oper. Res. 302(2): 341-362 (2021) - Mohammed Alnahhal, Mosab I. Tabash
, Diane Ahrens:
Optimal selection of third-party logistics providers using integer programming: a case study of a furniture company storage and distribution. Ann. Oper. Res. 302(1): 1-22 (2021) - Sylvain Béal
, André Casajus, Eric Rémila, Philippe Solal:
Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations. Ann. Oper. Res. 302(1): 23-47 (2021) - Amarjit Budhiraja, Shu Lu
, Yang Yu, Quoc Tran-Dinh:
Minimization of a class of rare event probabilities and buffered probabilities of exceedance. Ann. Oper. Res. 302(1): 49-83 (2021) - An Chen
, Thai Nguyen, Manuel Rach
:
A collective investment problem in a stochastic volatility environment: The impact of sharing rules. Ann. Oper. Res. 302(1): 85-109 (2021) - Wenquan Dong
, Mingzhou Jin
, Yanyan Wang, Peter Kelle:
Retrieval scheduling in crane-based 3D automated retrieval and storage systems with shuttles. Ann. Oper. Res. 302(1): 111-135 (2021) - Josep Freixas
, Montserrat Pons
:
An extension and an alternative characterization of May's theorem. Ann. Oper. Res. 302(1): 137-150 (2021) - Vicky Ching Gu, Bin Zhou
, Qing Cao, Jeffery Adams:
Exploring the relationship between supplier development, big data analytics capability, and firm performance. Ann. Oper. Res. 302(1): 151-172 (2021) - Britta Herres
, Heinz Schmitz
:
Decomposition of university course timetabling. Ann. Oper. Res. 302(2): 405-423 (2021) - Matthias Horn
, Günther R. Raidl, Elina Rönnberg
:
A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources. Ann. Oper. Res. 302(2): 477-505 (2021) - Hagai Ilani, Tal Grinshpoun
, Elad Shufan:
Bounded colouring motivated by the limited resource partially concurrent open shop problem. Ann. Oper. Res. 302(2): 461-476 (2021) - Emil Karlsson
, Elina Rönnberg
, Andreas Stenberg, Hannes Uppman
:
A matheuristic approach to large-scale avionic scheduling. Ann. Oper. Res. 302(2): 425-459 (2021) - Jeffrey H. Kingston
:
Modelling history in nurse rostering. Ann. Oper. Res. 302(2): 391-404 (2021) - Feng Li
, Han Wu, Qingyuan Zhu, Liang Liang, Gang Kou:
Data envelopment analysis cross efficiency evaluation with reciprocal behaviors. Ann. Oper. Res. 302(1): 173-210 (2021) - Jiarong Luo
, Xu Chen
, Chong Wang, Gaoxun Zhang:
Bidirectional options in random yield supply chains with demand and spot price uncertainty. Ann. Oper. Res. 302(1): 211-230 (2021) - Prasenjit Mandal
, Tarun Jain
, Abhishek Chakraborty
:
Quality collaboration contracts under product pricing strategies. Ann. Oper. Res. 302(1): 231-264 (2021) - Johannes Maschler, Günther R. Raidl:
Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources. Ann. Oper. Res. 302(2): 507-531 (2021) - Florian Mischek
, Nysret Musliu
:
A local search framework for industrial test laboratory scheduling. Ann. Oper. Res. 302(2): 533-562 (2021) - Anh Ninh
:
Robust newsvendor problems with compound Poisson demands. Ann. Oper. Res. 302(1): 327-338 (2021) - Ender Özcan, Edmund K. Burke, Luca Di Gaspero, Barry McCollum, Nysret Musliu
:
Preface: The practice and theory of automated timetabling (2018). Ann. Oper. Res. 302(2): 339-340 (2021) - Shipra Singh
, Savin Treanta:
Characterization results of weak sharp solutions for split variational inequalities with application to traffic analysis. Ann. Oper. Res. 302(1): 265-287 (2021) - Khosro Soleimani-Chamkhorami
, Saeid Ghobadi:
Cost-efficiency under inter-temporal dependence. Ann. Oper. Res. 302(1): 289-312 (2021) - Xu Tian
, Gongbing Bi:
Award scheme in random trial contests. Ann. Oper. Res. 302(1): 313-325 (2021) - Toni Ismael Wickert
, Alberto Francisco Kummer Neto, Márcio M. Boniatti, Luciana S. Buriol:
An integer programming approach for the physician rostering problem. Ann. Oper. Res. 302(2): 363-390 (2021)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-27 05:11 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