A GRASP for graph planarization

DOI10.1002/(SICI)1097-0037(199705)29:3%3C173::AID-NET5%3E3.0.CO;2-EMaRDI QIDQ4347284zbMATH OpenOpenAlexFDO

Authors Mauricio G. C. Resende, Celso C. Ribeiro

Publication date 7 August 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199705)29:3%3C173::aid-net5%3E3.0.co;2-e

zbMATH Keywords

graph planarizationgreedy randomized adaptive search procedurelocal searchmetaheuristic

Mathematics Subject Classification ID

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

Recommendations

• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 1241389
• An annotated bibliography of GRASP – Part I: Algorithms
• GRASP: An annoted bibliography
• scientific article; zbMATH DE number 2050708

Cited in

(22)

• Metaheuristics: A bibliography
• Designing and reporting on computational experiments with heuristic methods
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
• GRASP for seam drawing in mosaicking of aerial photographic maps
• Heuristics for the maximum outerplanar subgraph problem
• Hybrid metaheuristics: an introduction
• Domain reduction using GRASP construction phase for transmission expansion planning problem
• A nonmonotone GRASP
• An improved GRASP based circuit partitioning algorithm
• Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications
• scientific article; zbMATH DE number 1241389 (Why is no real title available?)
• An analysis of heuristics for graph planarization
• GRIP: Graph Drawing with Intelligent Placement
• Algorithm 797
• Linear programming based meta-heuristics for the weighted maximal planar graph
• A simulated annealing algorithm for the maximum planar subgraph problem
• A linear-time algorithm for finding induced planar subgraphs
• A GRASP-based approach for technicians and interventions scheduling for telecommunications
• 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 walk on the wild side: a shape-first methodology for orthogonal drawings

This page was built for publication: A GRASP for graph planarization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347284)