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