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

Related topics

Related topics

2 relations
Boolean satisfiability problemDPLL algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for… Expand
2014
2014
Hybridisation of decomposition and GRASP for combinatorial multiobjective optimisation
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
Social and dynamic graph-based scalable routing protocol in a DTN network
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
A hybrid data mining metaheuristic for the p-median problem
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
A hybrid ACO-GRASP algorithm for clustering analysis
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
Multiple phase neighborhood Search—GRASP based on Lagrangean relaxation, random backtracking Lin–Kernighan and path relinking for the TSP
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 GLOBAL optimization method revisited
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
Applications of the DM-GRASP heuristic: a survey
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
A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
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
Computing 3-D optimal form-closure grasps
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
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE