102 search results - page 9 / 21 » A Stochastic Local Search Approach to Vertex Cover |
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
WSC
2004
13 years 9 months ago
2004
We present a new random search method for solving simulation optimization problems. Our approach emphasizes the need for maintaining the right balance between exploration and expl...
COR
2010
13 years 8 months ago
2010
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
APIN
1999
13 years 7 months ago
1999
The problem of figure-ground separation is tackled from the perspective of combinatorial optimization. Previous attempts have used deterministic optimization techniques based on re...
CONSTRAINTS
2007
13 years 8 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...