Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

Cited In (59)

A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring
Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty
Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption
Transit pattern detection using tensor factorization
A memetic algorithm with adaptive operator selection for graph coloring
Metaheuristics: A Canadian Perspective
Iterated greedy for the maximum diversity problem
Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
Bayesian stopping rules for greedy randomized procedures
A sequential GRASP for the therapist routing and scheduling problem
Improved state space relaxation for constrained two-dimensional guillotine cutting problems
On Monte Carlo tree search for weighted vertex coloring
The leader multipurpose shopping location problem
A GRASP and path relinking heuristic for rural road network development
A GRASP approach for the extended car sequencing problem
Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems
A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
Applications of the DM‐GRASP heuristic: a survey
GRASP for set packing problems.
A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
Adaptive feasible and infeasible tabu search for weighted vertex coloring
Exact weighted vertex coloring via branch-and-price
A reactive GRASP with path relinking for capacitated clustering
A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
Finding minimum and equitable risk routes for hazmat shipments
Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
A reactive GRASP and path relinking for a combined production-distribution problem
A survey on optimization metaheuristics
Solving a bus driver scheduling problem with randomized multistart heuristics
GRASP with evolutionary path-relinking for the capacitated arc routing problem
Reactive GRASP for the strip-packing problem
A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits
The open capacitated arc routing problem
Models and heuristic algorithms for a weighted vertex coloring problem
Heuristic and exact algorithms for a min-max selective vehicle routing problem
Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
A combinatorial algorithm for the TDMA message scheduling problem
A GRASP algorithm to solve the unicost set covering problem
A GRASP metaheuristic for microarray data analysis
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
Power optimization in ad hoc wireless network topology control with biconnectivity requirements
Randomized heuristics for the family traveling salesperson problem
A hybrid heuristic for the diameter constrained minimum spanning tree problem
A reactive GRASP for a commercial territory design problem with multiple balancing requirements
A GRASP heuristic for slab scheduling at continuous casters
Metaheuristics in combinatorial optimization
GRASP and path relinking for the max-min diversity problem
Iterated local search with tabu search for the weighted vertex coloring problem
A tabu search approach for scheduling hazmat shipments
A capacitated facility location problem with constrained backlogging probabilities
Metaheuristics -- the metaphor exposed
Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
Hybrid metaheuristics: an introduction
A variable neighborhood search algorithm for the multimode set covering problem
Local search-based hybrid algorithms for finding Golomb rulers
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP

This page was built for publication: Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427329)