The Wardrop equilibrium model is widely used for traffic pattern prediction in transportation networks. One of the reasons that this can be converted into an equivalent optimization problem, which makes numerical evaluation straightforward and efficient. This conversion approach has been extended to networks with link capacities. It known solution resulting constrained problem a flow satisfying...

Clustering addresses the problem of assigning similar objects to groups. Since size clusters is often constrained in practical clustering applications, various capacitated problems have received increasing attention. We consider here p-median (CPMP) which p are selected as cluster centers (medians) such that total distance from these medians their assigned minimized. Each object associated with...

The Maximum static flow problem, in a single-source-single-sink network, deals with finding the maximum amount of from source to sink. Given set possible sinks, identification sink that maximizes is an important optimization problem. In this work, we consider problem when sinks have given capacities. We devise simple network transformation so algorithms uncapacitated case can be used capacitate...