Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 221,894,029 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Boolean satisfiability problem
DPLL algorithm
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Accelerating continuous GRASP with a GPU
B. Nogueira
,
E. Tavares
,
J. Araujo
,
G. Callou
Journal of Supercomputing
2019
Corpus ID: 93003698
This work proposes a GPU-based parallelization for the Continuous GRASP (C-GRASP), a local search metaheuristic for finding cost…
Expand
2017
2017
Quadratic Assignation Problem: A solution approach with parallel GRASP
María Beatríz Bernábe Loranca
,
Martín Estrada Analco
,
Rogelio González Velázquez
,
Abraham Sánchez López
,
Jorge Cerezo Sánchez
,
Mario Bustillo Díaz
International Journal of Combinatorial…
2017
Corpus ID: 34931613
The goal of this work is to establish and solve the Quadratic As-signation Problem (QAP) as a combinatory optimization problem by…
Expand
2015
2015
DC-GRASP: directing the search on continuous-GRASP
T. Araújo
,
Lisieux Marie M. S. Andrade
,
Carlos Magno
,
Lucídio A. F. Cabral
,
Roberto Quirino do Nascimento
,
C. N. Meneses
Journal of Heuristics
2015
Corpus ID: 38065661
Several papers in the scientific literature use metaheuristics to solve continuous global optimization. To perform this task…
Expand
2012
2012
Multiple Sink and Relay Placement in Wireless Sensor Networks
Lanny Sitanayah
,
Kenneth N. Brown
,
C. Sreenan
2012
Corpus ID: 7473275
Wireless sensor networks are subject to failures. Deployment planning should ensure that when a sink or sensor node fails, the…
Expand
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…
Expand
2012
2012
Social and dynamic graph-based scalable routing protocol in a DTN network
F. Rango
,
Filippo Monteverdi
International Symposium on Performance Evaluation…
2012
Corpus ID: 6976814
In this paper we consider the DTN routing problem in networks where the links between nodes are not stable, but tend to change…
Expand
2010
2010
H-GRASP:advanced GRASP-based hybrid SAT solver
Chen Jian-hui
2010
Corpus ID: 63426074
In order to improve the limitations of GRASP,this paper proposed a new hybrid algorithm(H-GRASP),which could resolve the problem…
Expand
2009
2009
Multiple phase neighborhood Search—GRASP based on Lagrangean relaxation, random backtracking Lin–Kernighan and path relinking for the TSP
Yannis Marinakis
,
A. Migdalas
,
P. Pardalos
Journal of combinatorial optimization
2009
Corpus ID: 36393032
Abstract In this paper, a new modified version of Greedy Randomized Adaptive Search Procedure (GRASP), called Multiple Phase…
Expand
2009
2009
Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis
Yannis Marinakis
,
Magdalene Marinaki
,
N. Matsatsinis
,
C. Zopounidis
Operational Research
2009
Corpus ID: 42996914
This paper presents a new memetic algorithm, which is based on the concepts of genetic algorithms (GAs), particle swarm…
Expand
2007
2007
A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
B. Shahul
,
Hamid Khan
,
G. Prabhaharan
,
P. Asokan
International Journal of Computational…
2007
Corpus ID: 27259094
In this paper we address the problem of minimizing the weighted sum of makespan and maximum tardiness in an m-machine flow shop…
Expand
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)
ACCEPT & CONTINUE