3049 search results - page 189 / 610 » On the Convergence of Bound Optimization Algorithms |
194
click to vote
EUROCAST
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
230
Voted
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The advancement of network induces great demands on a series of applications such as the multicast routing. This paper firstly makes a brief review on the algorithms in ...
173
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has bee...
246
click to vote
ICOIN
2003
Springer
16 years 6 days ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
153
click to vote
CP
2009
Springer
16 years 1 months ago
2009
Springer
Multi-objective optimization is concerned with problems involving multiple measures of performance which should be optimized simultaneously. In this paper, we extend AND/OR Branch-...