Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

2 relations
Boolean satisfiability problemDPLL algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A Hybrid Stochastic HS-GRASP Algorithm for the VRP with Time Windows
In this paper a new stochastic methodology hybrid HS-GRASP is proposed on the base of Harmony Search (HS) algorithm and Greedy… 
2015
2015
DC-GRASP: directing the search on continuous-GRASP
Several papers in the scientific literature use metaheuristics to solve continuous global optimization. To perform this task… 
2014
2014
A MULTICRITERIA PERMUTATION FLOWSHOP SCHEDULING PROBLEM WITH SETUP TIMES
: The permutation flow shop scheduling problem has been completely concentrated on in late decades, both from single objective… 
2013
2013
Independent contact regions for local force closure grasps
A grasp g is said to achieve local force closure with respect to a given external wrench wext if g can resist wext as well as any… 
2013
2013
Independent contact regions for local force closure grasps
2012
2012
Multiple Sink and Relay Placement in Wireless Sensor Networks
Wireless sensor networks are subject to failures. Deployment planning should ensure that when a sink or sensor node fails, the… 
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… 
2012
2012
GRASP-BSMA: A fast algorithm for delay constrained multicast routing
  • G. Feng
  • IEEE International Conference on Communications…
  • 2012
  • Corpus ID: 5183963
Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Many… 
2010
2010
H-GRASP:advanced GRASP-based hybrid SAT solver
In order to improve the limitations of GRASP,this paper proposed a new hybrid algorithm(H-GRASP),which could resolve the problem… 
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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)