Christina Büsing

Orcid: 0000-0002-3394-2788

Affiliations:
  • RWTH Aachen University, Germany


According to our database1, Christina Büsing authored at least 46 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The complexity of the timetable-based railway network design problem.
Networks, March, 2024

Robust transshipment problem under consistent flow constraints.
Networks, January, 2024

Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints.
Discret. Appl. Math., 2024

Structural insights about avoiding transfers in the patient-to-room assignment problem.
Discret. Appl. Math., 2024

Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms.
Discret. Appl. Math., 2024

2023
A branch and bound algorithm for robust binary optimization with budget uncertainty.
Math. Program. Comput., June, 2023

Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022
Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions.
BMC Medical Informatics Decis. Mak., 2022

Robust minimum cost flow problem under consistent flow constraints.
Ann. Oper. Res., 2022

One Transfer per Patient Suffices: Structural Insights About Patient-to-Room Assignment.
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

On the complexity of robust transshipment under consistent flow constraints.
Proceedings of the 10th International Network Optimization Conference, 2022

Foreword.
Proceedings of the 10th International Network Optimization Conference, 2022

Analysing the Complexity of Facility Location Problems with Capacities, Revenues, and Closest Assignments.
Proceedings of the 10th International Network Optimization Conference, 2022

Coworking Scheduling with Network Flows.
Proceedings of the 10th International Network Optimization Conference, 2022

2021
Preface: Special issue on network analytics and optimization.
Networks, 2021

Minimum color-degree perfect b-matchings.
Networks, 2021

Robust strategic planning for mobile medical units with steerable and unsteerable demands.
Eur. J. Oper. Res., 2021

2020
Agent-Based Simulation of Medical Care Processes in Rural Areas with the Aid of Current Data on ICT Usage Readiness Among Elderly Patients.
Proceedings of the Human Aspects of IT for the Aged Population. Healthy and Active Aging, 2020

2019
Capacity Uncertainty in Airline Revenue Management: Models, Algorithms, and Computations.
Transp. Sci., 2019

Formulations and algorithms for the recoverable Γ-robust knapsack problem.
EURO J. Comput. Optim., 2019

Patients, Primary Care, and Policy: Simulation Modeling for Health Care Decision Support.
CoRR, 2019

A Holistic System for Pre-clinical Diagnosis of Sleep Disorders in the Home Environment.
Proceedings of the 2019 IEEE International Conference on E-health Networking, 2019

2018
Multi-budgeted matching problems.
Networks, 2018

Robust and sustainable supply chains under market uncertainties and different risk attitudes - A case study of the German biodiesel market.
Eur. J. Oper. Res., 2018

Budgeted Colored Matching Problems.
Electron. Notes Discret. Math., 2018

Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation.
EURO J. Comput. Optim., 2018

2017
The budgeted minimum cost flow problem with unit upgrading cost.
Networks, 2017

Robust spectrum allocation in elastic flexgrid optical networks: Complexity and formulations.
Networks, 2017

Improved handling of uncertainty and robustness in set covering problems.
Eur. J. Oper. Res., 2017

Reference points and approximation algorithms in multicriteria discrete optimization.
Eur. J. Oper. Res., 2017

2016
The Capacitated Budgeted Minimum Cost Flow Problem with Unit Upgrading Costs.
Electron. Notes Discret. Math., 2016

Robust plans for spectrum allocation in elastic flexgrid optical networks.
Proceedings of the 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 2016

2014
Network planning under demand uncertainty with robust optimization.
IEEE Commun. Mag., 2014

2013
Robust Optimization under Multi-band Uncertainty - Part I: Theory
CoRR, 2013

0-1 Multiband Robust Optimization.
Proceedings of the Operations Research Proceedings 2013, 2013

A Generic Multi-layer Network Optimization Model with Demand Uncertainty.
Proceedings of the Advances in Communication Networking, 2013

Robust optimization under multiband uncertainty.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
Recoverable robust shortest path problems.
Networks, 2012

The Power of Compromise
CoRR, 2012

New Results about Multi-band Uncertainty in Robust Optimization.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

A New Theoretical Framework for Robust Optimization Under Multi-Band Uncertainty.
Proceedings of the Operations Research Proceedings 2012, 2012

2011
Recoverable robust knapsacks: the discrete scenario case.
Optim. Lett., 2011

Line planning, path constrained network flow and inapproximability.
Networks, 2011

Recoverable Robust Knapsacks: Γ-Scenarios.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
Robust Algorithms for Sorting Railway Cars.
Proceedings of the Algorithms, 2010

2009
The Exact Subgraph Recoverable Robust Shortest Path Problem.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009


  Loading...