7 Einträge gefunden

1. Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems

   1. Schulz, Arne
   2. Pfeiffer, Christian

   2024 - Forschungsinformationssystem der UHH - frei zugänglich
2. A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types - instance data

   1. Schulz, Arne
   2. Pfeiffer, Christian

   2023 - Forschungsdatenrepositorium der UHH - frei zugänglich
3. Instance data for "A Branch-and-Cut algorithm for an urban dial-a-ride problem" and "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems"

   1. Schulz, Arne
   2. Pfeiffer, Christian

   2022 - Forschungsdatenrepositorium der UHH - frei zugänglich
4. A Branch-and-Cut algorithm for an urban dial-a-ride problem - instance data

   1. Schulz, Arne
   2. Pfeiffer, Christian

   2022 - Forschungsdatenrepositorium der UHH - frei zugänglich
5. An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization - instance data

   1. Pfeiffer, Christian
   2. Schulz, Arne

   2021 - Forschungsdatenrepositorium der UHH - frei zugänglich
6. A new lower bound for the static dial-a-ride problem with ride and waiting time minimization - instance data

   1. Pfeiffer, Christian
   2. Schulz, Arne

   2021 - Forschungsdatenrepositorium der UHH - frei zugänglich
7. Mer tyrosine kinase promotes the survival of t(1;19)-positive acute lymphoblastic leukemia (ALL) in the central nervous system (CNS)

   1. Krause, Sarah
   2. Pfeiffer, Christian
   3. Strube, Susanne
   4. Alsadeq, Ameera
   5. Fedders, Henning
   6. Vokuhl, Christian
   7. Loges, Sonja

   2015 - Forschungsinformationssystem des UKE