3850 search results - page 614 / 770 » Optimal Linear Broadcast |
160
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Using a directed mutation can improve the efficiency of processing many optimization problems. The first mutation operators of this kind proposed by Hildebrand [1], however, suffer...
162
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
170
click to vote
SBCCI
2009
ACM
15 years 11 months ago
2009
ACM
The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications (MCM), has been a central operation and performance bottleneck in many applicat...
183
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
181
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...