GRASP - MaRDI portal

Cited in

(only showing first 100 items - show all)

Using a greedy random adaptative search procedure to solve the cover printing problem
GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
ALNS
QAPLIB
TSPLIB
PERL
GRASP for set packing problems.
MOTGA
OR-Library
Heuristics for the constrained incremental graph drawing problem
Making a state-of-the-art heuristic faster with data mining
A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times
Intelligent-guided adaptive search for the maximum covering location problem
BoneRoute
GRASP_QAP
The multi-vehicle cumulative covering tour problem
CirCut
LocalSolver
GRASP and VNS for solving the \(p\)-next center problem
Scatter Search
MersenneTwister
Efficient solutions for the far from most string problem
A GRASP algorithm for the closest string problem using a probability-based heuristic
Using GRASP to solve the unit commitment problem
A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
MACS-VRPTW
Diversification strategies in local search for a nonbifurcated network loading problem
Probability distribution of solution time in GRASP: an experimental investigation
SpeeDP
libcgrpp
MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
SimCList
SDP_S
TTTPLOTS
A multi-product production/distribution system design problem with direct shipments and lateral transshipments
Tabu search
An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem
A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations
Efficient approaches for the flooding problem on graphs
Simulation-based rolling horizon scheduling for operating theatres
GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
Flow shop scheduling problem with position-dependent processing times
XHSTT
On location-allocation problems for dimensional facilities
Towards an efficient resolution of printing problems
A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
The maximum balanced subgraph of a signed graph: applications and solution approaches
Quadratic bottleneck knapsack problems
Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
A Python/C library for bound-constrained global optimization with continuous GRASP
Logic based methods for SNPs tagging and reconstruction
Packing items to feed assembly lines
AntNet
A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines
Bayesian stopping rules for greedy randomized procedures
A biased random-key genetic algorithm for data clustering
Global optimization by continuous grasp
Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
GRASP and path relinking for project scheduling under partially renewable resources
Sequential search and its application to vehicle-routing problems
Expanding neighborhood GRASP for the traveling salesman problem
Heuristics for multi-stage interdiction of stochastic networks
A scatter search algorithm for project scheduling under partially renewable resources
Genetic Algorithm and Direct Search Toolbox
Algorithm 815
Algorithm 797
Algorithm 787
A GRASP and path relinking heuristic for rural road network development
Algorithm 769
An efficient GRASP algorithm for disassembly sequence planning
On some optimization problems in molecular biology
Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
The leader multipurpose shopping location problem
GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem
Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem
Hyperion
GOAL
A grasp interactive approach to the vehicle routing problem with backhauls
Strategies for the parallel implementation of metaheuristics
GRASP: An annoted bibliography
bibliometrix
M-MACBETH
Hybridizations of GRASP with path relinking for the far from most string problem
A review of hyper-heuristics for educational timetabling
Algorithms for sparsity-constrained optimization
An approach for efficient ship routing
GRASP with path relinking for three-index assignment
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
Advanced scatter search for the max-cut problem
Hybrid metaheuristics: an introduction
A metaheuristic for security budget allocation in utility networks
Integer programming models for feature selection: new extensions and a randomized solution algorithm
Heuristics for the generalized median graph problem
FaceReader
A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem
A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
A hybrid data mining GRASP with path-relinking
A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem
Power optimization in ad hoc wireless network topology control with biconnectivity requirements
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem

This page was built for software: GRASP