153 search results - page 16 / 31 » Minimum cost subpartitions in graphs |
158
click to vote
DAM
1999
15 years 6 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
345
click to vote
GBRPR
2011
Springer
14 years 10 months ago
2011
Springer
Convexity represents an important principle of grouping in visual perceptual organization. This paper presents a new technique for contour grouping based on convexity and has the f...
159
click to vote
INFORMS
2008
15 years 6 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
196
click to vote
NETWORKS
2008
15 years 6 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
152
click to vote
ISCAS
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we introduce a tile-graph-based approach to power planning. For a given flooplan solution, the power inputs are modeled into a tile graph, the minimum capacity of e...