227 search results - page 13 / 46 » Approximation of the Quadratic Set Covering problem |
APPROX
2005
Springer
14 years 29 days ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract- This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The propo...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
NIPS
2007
13 years 8 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...