616 search results - page 2 / 124 » Hybrid Numerical Optimization for Combinatorial Network Prob... |
ICTAI
1999
IEEE
13 years 9 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
TNN
2010
12 years 11 months ago
2010
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...
CEC
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
IWANN
2005
Springer
13 years 10 months ago
2005
Springer
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
IDEAL
2005
Springer
13 years 10 months ago
2005
Springer
Consider a network of unreliable links, each of which comes with a certain price and reliability. Given a fixed budget, which links should be bought in order to maximize the syste...