| An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization C Pfeiffer, A Schulz OR Spectrum 44, 87-119, 2022 | 26 | 2022 |
| The balanced maximally diverse grouping problem with block constraints A Schulz European Journal of Operational Research 294 (1), 42-53, 2021 | 12 | 2021 |
| Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems A Schulz, C Pfeiffer European Journal of Operational Research 312 (2), 456-472, 2024 | 9 | 2024 |
| Levelling crane workload in multi-yard rail-road container terminals A Schulz, M Fliedner, B Fiedrich, C Pfeiffer European Journal of Operational Research 293 (3), 941-954, 2021 | 6 | 2021 |
| An efficient heuristic for the fixed-route vehicle-refueling problem A Schulz, Y Suzuki Transportation Research Part E: Logistics and Transportation Review 169, 102963, 2023 | 5 | 2023 |
| A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values A Schulz Annals of Operations Research 318 (1), 501-530, 2022 | 5 | 2022 |
| A New Lower Bound for the Static Dial-a-Ride Problem with Ride and Waiting Time Minimization C Pfeiffer, A Schulz Dynamics in Logistics - Proceedings of the 8th International Conference LDIC …, 2022 | 4 | 2022 |
| A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types A Schulz, C Pfeiffer Transportation Research Part E: Logistics and Transportation Review 181, 103394, 2024 | 2 | 2024 |
| The balanced maximally diverse grouping problem with attribute values A Schulz Discrete Applied Mathematics 335, 82-103, 2023 | 2 | 2023 |
| The balanced maximally diverse grouping problem with integer attribute values A Schulz Journal of Combinatorial Optimization 45 (5), 135, 2023 | 2 | 2023 |
| Bounds and valid inequalities for the fixed-route vehicle-refueling problem A Schulz, Y Suzuki Computers & Industrial Engineering 170, 108340, 2022 | 2 | 2022 |
| A Tight Formulation for the Dial-a-Ride Problem D Gaul, K Klamroth, C Pfeiffer, A Schulz, M Stiglmayr arXiv preprint arXiv:2308.11285, 2023 | 1 | 2023 |
| Minimizing the expected waiting time of emergency jobs A Schulz, M Fliedner Journal of Scheduling 26 (2), 147-167, 2023 | 1 | 2023 |
| Scheduling of waterways with tide and passing box L Nehrke, A Schulz Naval Research Logistics (NRL) 69 (4), 609-621, 2022 | 1 | 2022 |
| The balanced maximally diverse grouping problem with attribute values and varying group sizes A Schulz International Conference on Operations Research, 148-153, 2021 | 1 | 2021 |
| Using infeasible path cuts to solve Electric Vehicle Routing Problems with realistic charging functions exactly within a branch-and-cut framework A Schulz EURO Journal on Transportation and Logistics 13, 100131, 2024 | | 2024 |
| Efficient neighborhood evaluation for the Maximally Diverse Grouping Problem A Schulz | | 2023 |
| A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types - instance data A Schulz, C Pfeiffer http://doi.org/10.25592/uhhfdm.11183, 2023 | | 2023 |
| A Branch-and-Cut algorithm for an urban dial-a-ride problem - instance data A Schulz, C Pfeiffer https://doi.org/10.25592/uhhfdm.10027, 2022 | | 2022 |
| A Branch-and-Cut algorithm for an urban dial-a-ride problem A Schulz, C Pfeiffer arXiv preprint arXiv:2208.00805, 2022 | | 2022 |
Yoshinori SuzukiIowa State University在 iastate.edu 的电子邮件经过验证
