Daniel Schermer

PhD thesis, 2024

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner Müller-Merbach, a Former President of IFORS).

[BibT_eX]

[DOI]

CoRR, 2024

2023

Formulations for the Split Delivery Capacitated Profitable Tour Problem.

[BibT_eX]

[DOI]

Marvin Caspar

Proceedings of the Computational Science and Its Applications - ICCSA 2023, 2023

2020

A branch-and-cut approach and alternative formulations for the traveling salesman problem with drone.

[BibT_eX]

[DOI]

Networks, 2020

The Drone-Assisted Traveling Salesman Problem with Robot Stations.

[BibT_eX]

[DOI]

Proceedings of the 53rd Hawaii International Conference on System Sciences, 2020

2019

A hybrid VNS/Tabu search algorithm for solving the vehicle routing problem with drones and en route operations.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2019

The Traveling Salesman Drone Station Location Problem.

[BibT_eX]

[DOI]

Proceedings of the Optimization of Complex Systems: Theory, 2019

2018

Integration of Drones in Last-Mile Delivery: The Vehicle Routing Problem with Drones.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2018, 2018

Algorithms for Solving the Vehicle Routing Problem with Drones.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Information and Database Systems - 10th Asian Conference, 2018

2017

A Hybrid Evolutionary Approach for Solving the Traveling Thief Problem.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2016

Swarm of agents for guarding an Art Gallery: A computational study.

[BibT_eX]

[DOI]