840 search results - page 63 / 168 » Inapproximability of Combinatorial Optimization Problems |
105
click to vote
EVOW
2007
Springer
15 years 6 months ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
130
click to vote
IPCO
2008
15 years 1 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
118
click to vote
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
127
Voted
DISOPT
2010
15 years 14 days ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
139
click to vote
NCA
2008
IEEE
15 years 10 days ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...