16404 search results - page 889 / 3281 » A set coverage problem |
200
click to vote
AUTOMATICA
2008
15 years 7 months ago
2008
In this paper we address the problem of optimal switching for switched linear systems. The uniqueness of our approach lies in describing the switching action by multiple control i...
198
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
172
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of...
201
click to vote
DISOPT
2008
15 years 7 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
200
click to vote
IANDC
2008
15 years 7 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...