A GRASP for graph planarization

DOI<173::AID-NET5>3.0.CO;2-E 10.1002/(SICI)1097-0037(199705)29:3<173::AID-NET5>3.0.CO;2-EzbMath0885.90112OpenAlexW1981470489MaRDI QIDQ4347284

Celso Carneiro Ribeiro, Mauricio G. C. Resende

Publication date: 7 August 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199705)29:3<173::aid-net5>3.0.co;2-e

zbMATH Keywords

local searchmetaheuristicgreedy randomized adaptive search proceduregraph planarization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

A nonmonotone GRASP, A simulated annealing algorithm for the maximum planar subgraph problem, Metaheuristics: A bibliography, Designing and reporting on computational experiments with heuristic methods, Hybrid Metaheuristics: An Introduction, The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions, An improved algorithm for finding maximum outerplanar subgraphs, Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms, A GRASP-based approach for technicians and interventions scheduling for telecommunications, A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem, Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications, Heuristics for the maximum outerplanar subgraph problem, A Linear-Time Algorithm for Finding Induced Planar Subgraphs