The following pages link to A GRASP for graph planarization (Q4347284):
Displaying 16 items.
- A nonmonotone GRASP (Q340011) (← links)
- A GRASP-based approach for technicians and interventions scheduling for telecommunications (Q542005) (← links)
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
- Heuristics for the maximum outerplanar subgraph problem (Q2573002) (← links)
- Hybrid Metaheuristics: An Introduction (Q2950517) (← links)
- Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications (Q3644814) (← links)
- An analysis of heuristics for graph planarization (Q4354090) (← links)
- GRIP: Graph Drawing with Intelligent Placement (Q4405598) (← links)
- Linear programming based meta-heuristics for the weighted maximal planar graph (Q4656733) (← links)
- A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415) (← links)
- A Linear-Time Algorithm for Finding Induced Planar Subgraphs (Q5140735) (← links)
- The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions (Q6087141) (← links)
- An improved algorithm for finding maximum outerplanar subgraphs (Q6184327) (← links)