117
click to vote
COCOON
15 years 1 months ago
2004 Springer 
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
114
click to vote
COCOON
15 years 3 months ago
2004 Springer 
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
COCOON
15 years 3 months ago
2004 Springer
Abstract. The supply chain between manufacturers and retailers always includes transshipments through a network of locations. A major challenge in making demand meet supply has bee...
COCOON
15 years 3 months ago
2004 Springer
We consider the fault hamiltonian properties of m×n meshes with two wraparound edges in the first row and the last row, denoted by M2(m, n), m ≥ 2, n ≥ 3. M2(m, n) is a spann...
COCOON
15 years 3 months ago
2004 Springer  |
Combinatorics