Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 4008427

From MaRDI portal
Publication:3758860
Jump to:navigation, search

zbMATH Open0622.05034MaRDI QIDQ3758860FDOQ3758860


Authors: Les R. Foulds Edit this on Wikidata


Publication date: 1985



Title of this publication is not available (Why is that?)



Recommendations

  • scientific article; zbMATH DE number 568799
  • The Vertex Splitting Algorithm for facilities layout
  • Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
  • A New Graph-Theoretic Heuristic for Facility Layout
  • Facilities layout generalized model solved by n-boundary shortest path heuristics


zbMATH Keywords

facility location


Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Inventory, storage, reservoirs (90B05)



Cited In (2)

  • A connectivity graph generation approach for Manhattan path calculation in detailed facility layout
  • Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics





This page was built for publication:

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3758860&oldid=17292881"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 11:43. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki