Pages that link to "Item:Q4427329"
From MaRDI portal
The following pages link to Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment (Q4427329):
Displaying 50 items.
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
- A GRASP metaheuristic for microarray data analysis (Q336713) (← links)
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements (Q336735) (← links)
- GRASP with evolutionary path-relinking for the capacitated arc routing problem (Q336740) (← links)
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- A sequential GRASP for the therapist routing and scheduling problem (Q398907) (← links)
- Exact weighted vertex coloring via branch-and-price (Q448972) (← links)
- A GRASP heuristic for slab scheduling at continuous casters (Q480761) (← links)
- A survey on optimization metaheuristics (Q497180) (← links)
- A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- The open capacitated arc routing problem (Q716347) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- A GRASP approach for the extended car sequencing problem (Q835577) (← links)
- A combinatorial algorithm for the TDMA message scheduling problem (Q839680) (← links)
- Finding minimum and equitable risk routes for hazmat shipments (Q856784) (← links)
- A tabu search approach for scheduling hazmat shipments (Q856786) (← links)
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (Q862819) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- A reactive GRASP and path relinking for a combined production-distribution problem (Q883304) (← links)
- A variable neighborhood search algorithm for the multimode set covering problem (Q887195) (← links)
- Reactive GRASP for the strip-packing problem (Q941532) (← links)
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements (Q955609) (← links)
- GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
- GRASP for set packing problems. (Q1420382) (← links)
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP (Q1962023) (← links)
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems (Q1991111) (← links)
- On Monte Carlo tree search for weighted vertex coloring (Q2163775) (← links)
- Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
- A hybrid heuristic for the diameter constrained minimum spanning tree problem (Q2268933) (← links)
- Iterated greedy for the maximum diversity problem (Q2275623) (← links)
- A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits (Q2289922) (← links)
- Local search-based hybrid algorithms for finding Golomb rulers (Q2385176) (← links)
- Bayesian stopping rules for greedy randomized procedures (Q2433924) (← links)
- A GRASP and path relinking heuristic for rural road network development (Q2573003) (← links)
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling (Q2630226) (← links)
- Iterated local search with tabu search for the weighted vertex coloring problem (Q2664440) (← links)
- The leader multipurpose shopping location problem (Q2672066) (← links)
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs (Q2819518) (← links)
- Hybrid Metaheuristics: An Introduction (Q2950517) (← links)
- Solving a bus driver scheduling problem with randomized multistart heuristics (Q4918247) (← links)
- Randomized heuristics for the family traveling salesperson problem (Q4979987) (← links)
- Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992) (← links)
- Transit Pattern Detection Using Tensor Factorization (Q5138237) (← links)
- Metaheuristics—the metaphor exposed (Q5246818) (← links)
- Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption (Q6056166) (← links)
- Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems (Q6062003) (← links)
