Skip to main content

An efficient heuristic for identifying a maximum weight planar subgraph

Contributed Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 952)

Keywords

  • Layout Problem
  • Facility Layout
  • Quadratic Assignment Problem
  • Facility Layout Problem
  • Adjacency List

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.M. Apple, Plant Layout and Materials Handling (Ronald Press, New York, 2nd Ed., 1963).

    Google Scholar 

  2. G.E.P. Box and M.E. Muller, A note on the generation of random normal deviates, Ann. Maths. Stats. 29 (1958) 610–611.

    CrossRef  MATH  Google Scholar 

  3. E.S. Buffa, G.C. Armour and T.E. Vollman, Allocating facilities with CRAFT, Harvard Business Review 42 (1964) 136–159.

    Google Scholar 

  4. N. Christofides, G. Galliani and L. Stefanini, An algorithm for the maximal planar graph problem based on Lagrangean relaxation, to appear.

    Google Scholar 

  5. J.W. Dickey and J. Hopkins, Campus building arrangement using TOPAZ, Transp. Res. 6 (1972) 59–68.

    CrossRef  Google Scholar 

  6. A.N. Elshafei, Hospital layout as a quadratic assignment problem, Op. Res. Quart. 28 (1977) 167–179.

    CrossRef  MATH  Google Scholar 

  7. L.R. Foulds, The facilities design problem: a survey, to appear.

    Google Scholar 

  8. L.R. Foulds and D.F. Robinson, A strategy for solving the plant layout problem, Op. Res. Quart. 27 (1976) 845–855.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. M.R. Garey and D.S. Johnson, Computers and Intractability (Freeman, San Francisco, 1979).

    MATH  Google Scholar 

  10. F.S. Hillier and M.H. Connors, Quadratic assignment problem algorithm and the location of indivisible facilities, Management Science 13 (1966) 42–57.

    CrossRef  Google Scholar 

  11. J.M. Moore, Plant Layout and Design (Macmillan, New York, 1962).

    Google Scholar 

  12. R. Mather, Systematic Layout Planning (Lahners, Boston, 2nd ed., 1973).

    Google Scholar 

  13. Z. Skupien, Locally Hamiltonian and planar graphs, Fund. Maths. 58 (1966) 193–200.

    MathSciNet  MATH  Google Scholar 

  14. C. Thomassen, Planarity and duality finite and graphs, J. Comb. Th. Series B, 29 (1980) 244–271.

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. W.T. Tutte, A theory of 3-connected graphs, Indag. Math. 29 (1961) 441–455.

    CrossRef  MathSciNet  MATH  Google Scholar 

  16. T.E. Vollman, C.E. Nugent and R.L. Zartler, A computerized model for office layout, J. Ind. Eng. 19 (1968) 321–327.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1982 Springer-Verlag

About this paper

Cite this paper

Eades, P., Foulds, L., Giffin, J. (1982). An efficient heuristic for identifying a maximum weight planar subgraph. In: Billington, E.J., Oates-Williams, S., Street, A.P. (eds) Combinatorial Mathematics IX. Lecture Notes in Mathematics, vol 952. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0061982

Download citation

  • DOI: https://doi.org/10.1007/BFb0061982

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11601-1

  • Online ISBN: 978-3-540-39375-7

  • eBook Packages: Springer Book Archive