The following pages link to GRASP (Q13838):
Displaying 50 items.
- A review of hyper-heuristics for educational timetabling (Q284387) (← links)
- Integer programming models for feature selection: new extensions and a randomized solution algorithm (Q322475) (← links)
- Heuristics for the generalized median graph problem (Q323345) (← links)
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
- A hybrid data mining GRASP with path-relinking (Q336726) (← links)
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem (Q336733) (← links)
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements (Q336735) (← links)
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- Multi-directional local search (Q339654) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- The constrained shortest path tour problem (Q342457) (← links)
- A sequential GRASP for the therapist routing and scheduling problem (Q398907) (← links)
- Multi-depot vessel routing problem in a direction dependent wavefield (Q405664) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
- A GRASP heuristic for slab scheduling at continuous casters (Q480761) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- A survey on optimization metaheuristics (Q497180) (← links)
- A GRASP-based approach for technicians and interventions scheduling for telecommunications (Q542005) (← links)
- A GRASP metaheuristic to improve accessibility after a disaster (Q647512) (← links)
- Restart strategies for GRASP with path-relinking heuristics (Q691439) (← links)
- Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
- A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution (Q763242) (← links)
- GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
- Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems (Q764792) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- A combinatorial algorithm for the TDMA message scheduling problem (Q839680) (← links)
- Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
- On the number of local minima for the multidimensional assignment problem (Q867022) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- Tabu search and GRASP for the capacitated clustering problem (Q887182) (← links)
- Tabu search versus GRASP for the maximum diversity problem (Q926570) (← links)
- Logic classification and feature selection for biomedical data (Q929151) (← links)
- A GRASP algorithm for the multi-criteria minimum spanning tree problem (Q940883) (← links)
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem (Q941025) (← links)
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
- A scheduling problem with unrelated parallel machines and sequence dependent setups (Q973463) (← links)
- Speeding up continuous GRASP (Q976348) (← links)
- Using a greedy random adaptative search procedure to solve the cover printing problem (Q1040963) (← links)
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem (Q1044091) (← links)
- GRASP for set packing problems. (Q1420382) (← links)
- Heuristics for the constrained incremental graph drawing problem (Q1634310) (← links)
- Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
- A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times (Q1651555) (← links)
- Intelligent-guided adaptive search for the maximum covering location problem (Q1652063) (← links)
- The multi-vehicle cumulative covering tour problem (Q1686527) (← links)
- GRASP and VNS for solving the \(p\)-next center problem (Q1725619) (← links)
- Efficient solutions for the far from most string problem (Q1761847) (← links)
