The capacitated clustering problem (CCP) is the problem in which a given set of weighted objects is to be partitioned into clusters so that the total weight of objects in each cluster is less than aâ€¦ (More)

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does notâ€¦ (More)

In the capacitated clustering problem (CCP), a given set of n weighted points is to be partitioned into p clusters such that, the total weight of the points in each cluster does not exceed a givenâ€¦ (More)

E-government services involve many stakeholders who have different objectives that can have an impact on success. Among these stakeholders, citizens are the primary stakeholders of governmentâ€¦ (More)

In the Capacitated Clustering Problem (CCP), a given set of n weighted points is to be partitioned into p clusters such that, the total weight of the points in each cluster does not exceed a givenâ€¦ (More)

The paper addresses the total weighted tardiness single-machine scheduling problem with machine availability constraints. Each machine can handle one job at a time and has a set of maintenanceâ€¦ (More)