GRASP

swMATH1094MaRDI QIDQ13838FDOQ13838

Author name not available (Why is that?)

Described by source

• Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP

Cited In (only showing first 100 items - show all)

• A scatter search algorithm for project scheduling under partially renewable resources
• A Python/C library for bound-constrained global optimization with continuous GRASP
• A sequential GRASP for the therapist routing and scheduling problem
• Multi-depot vessel routing problem in a direction dependent wavefield
• 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
• Advanced scatter search for the max-cut problem
• Hybrid Metaheuristics: An Introduction
• On some optimization problems in molecular biology
• Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
• Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
• An annotated bibliography of GRASP-Part II: Applications
• Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
• A grasp interactive approach to the vehicle routing problem with backhauls
• Global optimization by continuous grasp
• Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs
• Locating emergency services with different priorities: the priority queuing covering location problem
• A review of hyper-heuristics for educational timetabling
• An annotated bibliography of GRASP – Part I: Algorithms
• 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
• GRASP for set packing problems.
• Heuristics for the mirrored traveling tournament problem
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
• Randomized heuristics for the Max-Cut problem
• Title not available (Why is that?)
• Using a greedy random adaptative search procedure to solve the cover printing problem
• Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
• 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
• Using GRASP to solve the unit commitment problem
• Speeding up continuous GRASP
• A survey on optimization metaheuristics
• Solving a bus driver scheduling problem with randomized multistart heuristics
• Integer programming models for feature selection: new extensions and a randomized solution algorithm
• Heuristics for the generalized median graph problem
• Branch and bound for the cutwidth minimization problem
• A GRASP metaheuristic to improve accessibility after a disaster
• Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
• Expanding neighborhood GRASP for the traveling salesman problem
• A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
• Algorithm 769
• A combinatorial algorithm for the TDMA message scheduling problem
• A GRASP algorithm to solve the unicost set covering problem
• A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem
• 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
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
• Power optimization in ad hoc wireless network topology control with biconnectivity requirements
• Revised GRASP with path-relinking for the linear ordering problem
• A GRASP heuristic for slab scheduling at continuous casters
• A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
• Improved heuristics for the regenerator location problem
• Metaheuristics in combinatorial optimization
• Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
• A nonmonotone GRASP
• GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
• Logic classification and feature selection for biomedical data
• The constrained shortest path tour problem
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
• Greedy random adaptive memory programming search for the capacitated clustering problem
• A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution
• GRASP with path-relinking for the generalized quadratic assignment problem
• A GRASP-based approach for technicians and interventions scheduling for telecommunications
• GRASP with path relinking for three-index assignment
• GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
• GRASP: An annoted bibliography
• Probability distribution of solution time in GRASP: an experimental investigation
• A GRASP algorithm for the multi-criteria minimum spanning tree problem
• Tabu search versus GRASP for the maximum diversity problem
• Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
• Simulation-based rolling horizon scheduling for operating theatres
• GRASP and path relinking for project scheduling under partially renewable resources
• Title not available (Why is that?)
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
• Efficient solutions for the far from most string problem
• Bayesian stopping rules for greedy randomized procedures
• Exploring grid implementations of parallel cooperative metaheuristics
• GRASP and VNS for solving the \(p\)-next center problem
• Diversification strategies in local search for a nonbifurcated network loading problem
• An approach for efficient ship routing
• An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem
• A scheduling problem with unrelated parallel machines and sequence dependent setups
• 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
• Towards an efficient resolution of printing problems
• A multi-product production/distribution system design problem with direct shipments and lateral transshipments
• The leader multipurpose shopping location problem
• A GRASP and path relinking heuristic for rural road network development
• An efficient GRASP algorithm for disassembly sequence planning
• Title not available (Why is that?)
• An efficient exact approach for the constrained shortest path tour problem
• Tabu search and GRASP for the capacitated clustering problem
• A hybrid data mining metaheuristic for the p‐median problem
• Flow shop scheduling problem with position-dependent processing times
• Strategies for the parallel implementation of metaheuristics

This page was built for software: GRASP