840 search results - page 52 / 168 » Inapproximability of Combinatorial Optimization Problems |
SODA
1992
ACM
14 years 5 days ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
ESA
2006
Springer
14 years 2 months ago
2006
Springer
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
HEURISTICS
2010
13 years 5 months ago
2010
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which bel...
CPAIOR
2010
Springer
14 years 3 months ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
SIAMDM
2008
13 years 11 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...