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

DOI10.1080/00207540110081498zbMATH Open1060.90700OpenAlexW2163599124MaRDI QIDQ4674441FDOQ4674441

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• A note on 'Efficient facility layout planning in a maximally planar graph model'
• Title not available (Why is that?)

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)