Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

GRASP (SAT solver)

Known as: Grasp (disambiguation) 
GRASP is a well known SAT instance solver. It was developed by João Marques Silva, a Portuguese computer science researcher. It stands for Generic… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for… Expand
2014
2014
This paper proposes an idea of using heuristic local search procedures specific for single-objective optimisation in… Expand
  • table I
  • figure 1
  • table III
  • table II
  • figure 3
2012
2012
In this paper we consider the DTN routing problem in networks where the links between nodes are not stable, but tend to change… Expand
  • table IV
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2011
2011
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2011
2011
Cluster analysis is an important tool for data exploration and it has been applied in a wide variety of fields like engineering… Expand
  • table 2
  • table 3
  • table 4
  • table 5
  • table 6
2009
2009
Abstract In this paper, a new modified version of Greedy Randomized Adaptive Search Procedure (GRASP), called Multiple Phase… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Highly Cited
2008
Highly Cited
2008
The multistart clustering global optimization method called GLOBAL has been introduced in the 1980s for bound constrained global… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Review
2008
Review
2008
Recent research has shown that the hybridization of metaheuristics is a powerful mechanism to develop more robust and efficient… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2007
2007
In this paper we address the problem of minimizing the weighted sum of makespan and maximum tardiness in an m-machine flow shop… Expand
2000
2000
We address the problem of computing optimal fingertip locations yielding n-finger form-closure grasps of polyhedral objects… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6