Cited in
(only showing first 100 items - show all)- A scatter search algorithm for project scheduling under partially renewable resources
- Probabilistic stopping rules for GRASP heuristics and extensions
- A sequential GRASP for the therapist routing and scheduling problem
- Bayesian stopping rules for greedy randomized procedures
- GRASP and VNS for solving the \(p\)-next center problem
- Exploring grid implementations of parallel cooperative metaheuristics
- Graph domination, coloring and cliques in telecommunications
- A Python/C library for bound-constrained global optimization with continuous GRASP
- Diversification strategies in local search for a nonbifurcated network loading problem
- Comparison of metaheuristics for the \(k\)-labeled spanning forest problem
- Multi-depot vessel routing problem in a direction dependent wavefield
- An approach for efficient ship routing
- A scheduling problem with unrelated parallel machines and sequence dependent setups
- An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem
- A biased random-key genetic algorithm for data clustering
- Heuristics for multi-stage interdiction of stochastic networks
- Sequential search and its application to vehicle-routing problems
- Towards an efficient resolution of printing problems
- Communication Models for a Cooperative Network of Autonomous Agents
- Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications
- Advanced scatter search for the max-cut problem
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
- A multi-product production/distribution system design problem with direct shipments and lateral transshipments
- 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
- Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
- An annotated bibliography of GRASP-Part II: Applications
- A review of hyper-heuristics for educational timetabling
- A GRASP and path relinking heuristic for rural road network development
- A grasp interactive approach to the vehicle routing problem with backhauls
- Global optimization by continuous grasp
- An efficient GRASP algorithm for disassembly sequence planning
- Locating emergency services with different priorities: the priority queuing covering location problem
- Tabu search and GRASP for the capacitated clustering problem
- An annotated bibliography of GRASP – Part I: Algorithms
- scientific article; zbMATH DE number 1960694 (Why is no real title available?)
- An efficient exact approach for the constrained shortest path tour problem
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- Applications of the DM‐GRASP heuristic: a survey
- Hybridizations of GRASP with path relinking for the far from most string problem
- A hybrid data mining metaheuristic for the p‐median problem
- Flow shop scheduling problem with position-dependent processing times
- GRASP for set packing problems.
- Heuristics for the constrained incremental graph drawing problem
- Making a state-of-the-art heuristic faster with data mining
- Strategies for the parallel implementation of metaheuristics
- Logic based methods for SNPs tagging and reconstruction
- Heuristics for the mirrored traveling tournament problem
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
- A metaheuristic for security budget allocation in utility networks
- Linear programming based meta-heuristics for the weighted maximal planar graph
- Randomized heuristics for the Max-Cut problem
- Using a greedy random adaptative search procedure to solve the cover printing problem
- Quadratic bottleneck knapsack problems
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
- Multi-directional local search
- On the number of local minima for the multidimensional assignment problem
- A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations
- 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
- Using GRASP to solve the unit commitment problem
- Speeding up continuous GRASP
- A survey on optimization metaheuristics
- QAPLIB
- TSPLIB
- PERL
- MOTGA
- OR-Library
- BoneRoute
- GRASP_QAP
- CirCut
- LocalSolver
- MersenneTwister
- Scatter Search
- MACS-VRPTW
- libcgrpp
- SpeeDP
- SimCList
- SDP_S
- TTTPLOTS
- Tabu search
- XHSTT
- AntNet
- Algorithm 815
- Genetic Algorithm and Direct Search Toolbox
- Algorithm 797
- Algorithm 787
- Algorithm 769
- GOAL
- Hyperion
- bibliometrix
- M-MACBETH
- A GRASP algorithm for the closest string problem using a probability-based heuristic
- FaceReader
- CitNetExplorer
- HapBlock
- 2-Phase NSGA II
- CiteSpace
This page was built for software: GRASP
