A note on 'Maximally weighted graph theoretic facilities design planning'

DOI10.1080/00207540110081498MaRDI QIDQ4674441zbMATH OpenOpenAlexFDO

Authors Latif A. al-Hakim

Publication date 11 May 2005

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207540110081498

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Recommendations

• Maximally weighted graph theoretic facilities design planning
• Algorithms in graph theory and their use for solving problems in architectural design
• Publication:5752600
• A note on 'Efficient facility layout planning in a maximally planar graph model'
• Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics

Cites work

• A note on 'Efficient facility layout planning in a maximally planar graph model'
• Efficient facility layout planning in a maximally planar graph model
• Maximally weighted graph theoretic facilities design planning
• Two graph-theoretic procedures for an improved solution to the facilities layout problem

Cited in

(2)

• scientific article; zbMATH DE number 4187850 (Why is no real title available?)
• A note on 'Efficient facility layout planning in a maximally planar graph model'

This page was built for publication: A note on 'Maximally weighted graph theoretic facilities design planning'

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