default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristina Büsing
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Christina Büsing, Sabrina Schmitz
:
Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints. Discret. Appl. Math. 347: 187-213 (2024)- [j25]Tabea Brandt, Christina Büsing, Sigrid Knust:
Structural insights about avoiding transfers in the patient-to-room assignment problem. Discret. Appl. Math. 347: 231-248 (2024) - [j24]Mariia Anapolska, Tabea Brandt, Christina Büsing, Tobias Mömke:
Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms. Discret. Appl. Math. 358: 230-253 (2024) - [j23]Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz:
Robust transshipment problem under consistent flow constraints. Networks 83(1): 53-82 (2024) - [j22]Nadine Friesen, Tim Sander, Christina Büsing, Karl Nachtigall, Nils Nießen:
The complexity of the timetable-based railway network design problem. Networks 83(2): 289-299 (2024) - 2023
- [j21]Christina Büsing, Timo Gersing, Arie M. C. A. Koster:
A branch and bound algorithm for robust binary optimization with budget uncertainty. Math. Program. Comput. 15(2): 269-326 (2023) - [c15]Christina Büsing, Timo Gersing, Arie M. C. A. Koster:
Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty. IPCO 2023: 58-71 - 2022
- [j20]Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz:
Robust minimum cost flow problem under consistent flow constraints. Ann. Oper. Res. 312(2): 691-722 (2022) - [j19]Neele Leithäuser, Dennis Adelhütte, Kristin Braun, Christina Büsing, Martin Comis, Timo Gersing, Sebastian S. Johann, Arie M. C. A. Koster, Sven O. Krumke, Frauke Liers, Eva Schmidt, Johanna Schneider, Manuel Streicher, Sebastian Tschuppik, Sophia Wrede:
Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions. BMC Medical Informatics Decis. Mak. 22(1): 132 (2022) - [c14]Mariia Anapolska, Christina Büsing, Tabea Krabs, Tobias Mömke:
Coworking Scheduling with Network Flows. INOC 2022: 1-6 - [c13]Christina Büsing, Timo Gersing, Sophia Wrede:
Analysing the Complexity of Facility Location Problems with Capacities, Revenues, and Closest Assignments. INOC 2022: 1-6 - [c12]Christina Büsing, Arie M. C. A. Koster:
Foreword. INOC 2022: 1-4 - [c11]Christina Büsing, Arie Koster, Sabrina Schmitz:
On the complexity of robust transshipment under consistent flow constraints. INOC 2022: 1-6 - [c10]Tabea Brandt, Christina Büsing, Sigrid Knust:
One Transfer per Patient Suffices: Structural Insights About Patient-to-Room Assignment. ISCO 2022: 245-259 - [e1]Christina Büsing, Arie M. C. A. Koster:
Proceedings of the 10th International Network Optimization Conference, INOC 2022, Aachen, Germany, June 7-10, 2022. OpenProceedings.org 2022, ISBN 978-3-89318-090-5 [contents] - 2021
- [j18]Christina Büsing, Martin Comis, Eva Schmidt, Manuel Streicher:
Robust strategic planning for mobile medical units with steerable and unsteerable demands. Eur. J. Oper. Res. 295(1): 34-50 (2021) - [j17]Bernard Fortz, Luis Gouveia, Christina Büsing, Markus Leitner:
Preface: Special issue on network analytics and optimization. Networks 77(4): 475-476 (2021) - [j16]Mariia Anapolska, Christina Büsing, Martin Comis, Tabea Krabs:
Minimum color-degree perfect b-matchings. Networks 77(4): 477-494 (2021) - 2020
- [c9]Christina Büsing, Sabrina Schmitz, Mariia Anapolska, Sabine Theis, Matthias Wille, Christopher Brandl, Verena Nitsch, Alexander Mertens:
Agent-Based Simulation of Medical Care Processes in Rural Areas with the Aid of Current Data on ICT Usage Readiness Among Elderly Patients. HCI (28) 2020: 3-12 - [i6]Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz:
Robust Minimum Cost Flow Problem Under Consistent Flow Constraints. CoRR abs/2008.02035 (2020)
2010 – 2019
- 2019
- [j15]Christina Büsing, Sebastian Goderbauer, Arie M. C. A. Koster, Manuel Kutschka:
Formulations and algorithms for the recoverable Γ-robust knapsack problem. EURO J. Comput. Optim. 7(1): 15-45 (2019) - [j14]Christina Büsing, Daniel Kadatz, Catherine Cleophas:
Capacity Uncertainty in Airline Revenue Management: Models, Algorithms, and Computations. Transp. Sci. 53(2): 383-400 (2019) - [c8]Marc Haßler, Andreas Burgdorf, André Pomp, Christian Kohlschein, Christina Büsing, Stephan M. Jonas:
A Holistic System for Pre-clinical Diagnosis of Sleep Disorders in the Home Environment. HealthCom 2019: 1-4 - [i5]Christina Büsing, Catherine Cleophas, Martin Comis:
Patients, Primary Care, and Policy: Simulation Modeling for Health Care Decision Support. CoRR abs/1910.11027 (2019) - 2018
- [j13]Christina Büsing, Sigrid Knust, Xuan Thanh Le:
Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation. EURO J. Comput. Optim. 6(4): 339-365 (2018) - [j12]Christina Büsing, Martin Comis:
Budgeted Colored Matching Problems. Electron. Notes Discret. Math. 64: 245-254 (2018) - [j11]Laura Elisabeth Hombach, Christina Büsing, Grit Walther:
Robust and sustainable supply chains under market uncertainties and different risk attitudes - A case study of the German biodiesel market. Eur. J. Oper. Res. 269(1): 302-312 (2018) - [j10]Christina Büsing, Martin Comis:
Multi-budgeted matching problems. Networks 72(1): 25-41 (2018) - 2017
- [j9]Christina Büsing, Kai-Simon Goetzmann, Jannik Matuschke, Sebastian Stiller:
Reference points and approximation algorithms in multicriteria discrete optimization. Eur. J. Oper. Res. 260(3): 829-840 (2017) - [j8]Pascal Lutter, Dirk Degel, Christina Büsing, Arie M. C. A. Koster, Brigitte Werners:
Improved handling of uncertainty and robustness in set covering problems. Eur. J. Oper. Res. 263(1): 35-49 (2017) - [j7]Christina Büsing, Arie Koster, Sarah Kirchner, Annika Thome:
The budgeted minimum cost flow problem with unit upgrading cost. Networks 69(1): 67-82 (2017) - [j6]Christina Büsing, Alexandra Grub, Arie M. C. A. Koster, Waldemar Laube, Martin Tieves:
Robust spectrum allocation in elastic flexgrid optical networks: Complexity and formulations. Networks 70(4): 342-359 (2017) - 2016
- [j5]Christina Büsing, Sarah Kirchner, Annika Thome:
The Capacitated Budgeted Minimum Cost Flow Problem with Unit Upgrading Costs. Electron. Notes Discret. Math. 55: 135-138 (2016) - [c7]Christina Büsing, Arie M. C. A. Koster, Martin Tieves:
Robust plans for spectrum allocation in elastic flexgrid optical networks. RNDM 2016: 108-115 - 2014
- [j4]Thomas Bauschert, Christina Büsing, Fabio D'Andreagiovanni, Arie M. C. A. Koster, Manuel Kutschka, Uwe Steglich:
Network planning under demand uncertainty with robust optimization. IEEE Commun. Mag. 52(2): 178-185 (2014) - 2013
- [c6]Uwe Steglich, Thomas Bauschert, Christina Büsing, Manuel Kutschka:
A Generic Multi-layer Network Optimization Model with Demand Uncertainty. EUNICE 2013: 13-24 - [c5]Christina Büsing, Fabio D'Andreagiovanni, Annie Raymond:
0-1 Multiband Robust Optimization. OR 2013: 89-95 - [i4]Christina Büsing, Fabio D'Andreagiovanni, Annie Raymond:
Robust optimization under multiband uncertainty. CTW 2013: 35-38 - [i3]Christina Büsing, Fabio D'Andreagiovanni:
Robust Optimization under Multi-band Uncertainty - Part I: Theory. CoRR abs/1301.2734 (2013) - 2012
- [j3]Christina Büsing:
Recoverable robust shortest path problems. Networks 59(1): 181-189 (2012) - [c4]Christina Büsing, Fabio D'Andreagiovanni:
A New Theoretical Framework for Robust Optimization Under Multi-Band Uncertainty. OR 2012: 115-121 - [c3]Christina Büsing, Fabio D'Andreagiovanni:
New Results about Multi-band Uncertainty in Robust Optimization. SEA 2012: 63-74 - [i2]Christina Büsing, Kai-Simon Goetzmann, Jannik Matuschke, Sebastian Stiller:
The Power of Compromise. CoRR abs/1207.3165 (2012) - [i1]Christina Büsing, Fabio D'Andreagiovanni:
New results about multi-band uncertainty in Robust Optimization. CoRR abs/1208.6322 (2012) - 2011
- [j2]Christina Büsing, Sebastian Stiller:
Line planning, path constrained network flow and inapproximability. Networks 57(1): 106-113 (2011) - [j1]Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka:
Recoverable robust knapsacks: the discrete scenario case. Optim. Lett. 5(3): 379-392 (2011) - [c2]Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka:
Recoverable Robust Knapsacks: Γ-Scenarios. INOC 2011: 583-588 - 2010
- [c1]Christina Büsing, Jens Maue:
Robust Algorithms for Sorting Railway Cars. ESA (1) 2010: 350-361
2000 – 2009
- 2009
- [p1]Christina Büsing:
The Exact Subgraph Recoverable Robust Shortest Path Problem. Robust and Online Large-Scale Optimization 2009: 231-248
Coauthor Index
aka: Arie Koster
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.
last updated on 2024-12-10 20:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
