The capacitated minimum spanning tree (CMST) problem is to 3nd a minimum cost spanning tree in a network where nodes have speci3ed demands, with an additional capacity constraints on the subtrees incident to a given source node s. The capacitated minimum spanning tree problem arises as an important subproblem in many telecommunication network design problems. In a recent paper, Ahuja et al. (Ma...

This study presents a capacitated multi-facility location-allocation problem with stochastic demands based on a well-known distribution function. In this discrete environment, besides the capacitated facilities, we can employee the capacitated sub-source of each facility for satisfying demands of customers. The objective function is to find the optimal locations of facilities among a finite num...

A strongly polynomial time algorithm is described to solve the node-capacitated routing problem in an undirected ring network.

In this paper, we consider k-level hard capacitated facility location problem.

We define an r-capacitated dominating set of a graph G = (V,E) as a set {v1, . . . , vk} ⊆ V such that there is a partition (V1, . . . , Vk) of V where for all i, vi ∈ Vi, vi is adjacent to all of Vi − {vi}, and |Vi| ≤ r + 1. kr(G) is the minimum cardinality of an r-capacitated dominating set. We show properties of kr, especially as regards the trivial lower bound |V |/(r+1). We calculate the v...

We present a fully polynomial time approximation scheme (FPTAS) for a capacitated economic lot-sizing problem with a monotone cost structure. An FPTAS delivers a solution with a given relative error ε in time polynomial in the problem size and in 1/ε. Such a scheme was developed by van Hoesel and Wagelmans [8] for a capacitated economic lot-sizing problem with monotone concave (convex) producti...