840 search results - page 104 / 168 » Inapproximability of Combinatorial Optimization Problems |
100
Voted
AAAI
2007
15 years 2 months ago
2007
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
128
Voted
AAAI
2000
15 years 1 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
103
Voted
IANDC
2006
15 years 12 days ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
DAM
2000
15 years 6 days ago
2000
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
113
Voted
PPSN
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...