A greedy random adaptive search procedure for the weighted maximal planar graph problem

@article{Osman2003AGR,
  title={A greedy random adaptive search procedure for the weighted maximal planar graph problem},
  author={Ibrahim H. Osman and Baydaa Al-Ayoubi and Musbah Barake},
  journal={Computers & Industrial Engineering},
  year={2003},
  volume={45},
  pages={635-651}
}
The weighted maximal planar graph (WMPG) problem seeks to find a subgraph from a given weighted complete graph such that the subgraph is planar—it can be embedded on the plane without any arcs intersecting. The subgraph is maximal—no additional arc can be added to the subgraph without destroying its planarity and it also has the maximal sum of arc weights. In this paper, the main objective is to develop, implement and empirically analyse a new greedy random adaptive search procedure (GRASP) to… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 41 references

Handbook of metaheuristics

G. Kochenberger
microcomputer. Computers and Industrial Engineering, • 2003
View 5 Excerpts
Highly Influenced

Efficient facility layout planning in a maximally planar graph model

E. Pesch, F. Glover, T. Bartsch, F. Salewski, I. H. Osman
International Journal of Production Research • 1999
View 4 Excerpts
Highly Influenced

A new graph-theoretic heuristic for facility layout

J. Leung
Management Science, • 1992
View 4 Excerpts
Highly Influenced

Two graph theoretical procedures for an improved solution to the facilities layout problem

L.A.S. Martello. Al-Hakim
International Journal of Production Research • 1991
View 9 Excerpts
Highly Influenced

A probabilistic heuristic for a computationally difficult set covering

T. A. 845–855. Feo, M.G.C. Resende
Operations Research Letters • 1989
View 4 Excerpts
Highly Influenced

A heuristic for facilities layout planning

R. Green, L. A. Al-Hakim
Omega • 1985
View 5 Excerpts
Highly Influenced

An introduction to metaheuristics

I. H. North-Holland. Osman
M. Lawrence, & C. Wilsdon (Eds.), Operational Research Tutorial • 1995
View 6 Excerpts
Highly Influenced

Local search algorithms for the maximal planar layout problem

M. Hasan, I. H. Osman
International Transactions in Operational Research • 1995
View 4 Excerpts
Highly Influenced

Planarity graph: Theory and algorithms (32)

N. Chiba
Annals of Discrete Mathematics, • 1988
View 3 Excerpts
Highly Influenced

A strategy for solving the plant layout problem

L. R. Foulds, D. F. Robinson
Operations Research Quarterly • 1976
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…