Die Analyse zeigt, dass Strategiebeweis-Mechanismen für die Standortwahl von Einrichtungen eine optimale Kostenapproximation erfordern.
Efficient algorithm developed for economic lot-sizing with piecewise linear production costs.
CCBC can provide optimal solutions for CVRP under specific conditions.
Efficiently solving the vehicle routing problem by leveraging clustering techniques.
Proposing a learning-guided iterated local search approach for the minmax multiple traveling salesman problem to achieve high-quality solutions efficiently.
Efficient neural network ensembles, such as batch ensemble, offer cost-effective and competitive alternatives to deep ensembles for industrial parts classification.
Integrating machine learning into Large Neighborhood Search (LNS) improves neighborhood selection efficiency for the Vehicle Routing Problem with Time Windows.
The author introduces a new formulation for the Moving-Target Traveling Salesman Problem (MT-TSP) based on convex sets, outperforming the current state-of-the-art Mixed Integer Conic Program (MICP) solver.
The author explores competitive facility location problems with random utilities and routing constraints, proposing innovative solution methods.
The author introduces a vehicle routing problem with synchronization constraints and support vehicle-dependent service times, focusing on the efficiency of production processes. The study highlights the impact of primary and support vehicles on service times.