Christina Büsing

From MaRDI portal
Person:510966

Available identifiers

zbMath Open busing.christinaMaRDI QIDQ510966

List of research outcomes





PublicationDate of PublicationType
Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms2024-09-26Paper
Robust spectrum allocation in elastic flexgrid optical networks: complexity and formulations2024-05-03Paper
The complexity of the timetable‐based railway network design problem2024-03-15Paper
Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints2024-02-27Paper
Structural insights about avoiding transfers in the patient-to-room assignment problem2024-02-27Paper
Robust transshipment problem under consistent flow constraints2024-01-18Paper
Minimum <scp>color‐degree</scp> perfect b‐matchings2023-12-11Paper
Recycling inequalities for robust combinatorial optimization with budget uncertainty2023-11-09Paper
One transfer per patient suffices: structural insights about patient-to-room assignment2023-08-03Paper
A branch and bound algorithm for robust binary optimization with budget uncertainty2023-07-24Paper
Robust minimum cost flow problem under consistent flow constraints2022-06-13Paper
Robust strategic planning for mobile medical units with steerable and unsteerable demands2021-11-05Paper
The Dial-a-Ride Problem in Primary Care with Flexible Scheduling2021-05-30Paper
Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem2019-10-18Paper
Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation2019-03-14Paper
Multi-budgeted matching problems2018-10-11Paper
The budgeted minimum cost flow problem with unit upgrading cost2018-06-13Paper
Reference points and approximation algorithms in multicriteria discrete optimization2018-05-29Paper
Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market2018-04-23Paper
Budgeted colored matching problems2018-04-11Paper
Improved handling of uncertainty and robustness in set covering problems2018-02-06Paper
The capacitated budgeted minimum cost flow problem with unit upgrading costs2017-02-14Paper
A new theoretical framework for robust optimization under multi-band uncertainty2015-02-12Paper
Recoverable robust knapsacks: the discrete scenario case2012-11-30Paper
Recoverable robust shortest path problems2012-06-18Paper
Recoverable robust knapsacks: \(\Gamma \)-scenarios2011-09-09Paper
Line planning, path constrained network flow and inapproximability2011-02-17Paper
Robust algorithms for sorting railway cars2010-09-06Paper
Graph optimization and network optimization2010-03-12Paper
The Exact Subgraph Recoverable Robust Shortest Path Problem2009-12-03Paper
Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room EntitlementsN/APaper

Research outcomes over time

This page was built for person: Christina Büsing