A well known transformation by Pearn, Assad and Golden reduces a Capacitated Arc Routing Problem (CARP) into an equivalent Capacitated Vehicle Routing Problem (CVRP). However, tha...
We consider the single itemcapacitated lot{sizingproblem, a well-known productionplanningmodelthat often arises in practical applications, and derive new classes of valid inequali...
Andrew J. Miller, George L. Nemhauser, Martin W. P...
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...