In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we pro...
We address a multi-item capacitated lot-sizing problem with setup times and shortage costs that arises in real-world production planning problems. Demand cannot be backlogged, but...
— Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search ...
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...