scientific article; zbMATH DE number 1206315

MaRDI QIDQ4209209zbMATH OpenFDO

Authors J. Merker

Publication date 5 October 1998

zbMATH Keywords

heuristic solution methodlayout planningmaximal planar weighted graph

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Discrete location and assignment (90B80)

Recommendations

• Efficient facility layout planning in a maximally planar graph model
• Local Search Algorithms for the Maximal Planar Layout Problem
• Two new heuristic algorithms for the maximal planar layout problem
• Linear programming based meta-heuristics for the weighted maximal planar graph
• A New Graph-Theoretic Heuristic for Facility Layout

Cited in

(6)

• Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
• Efficient facility layout planning in a maximally planar graph model
• Maximally weighted graph theoretic facilities design planning
• Linear programming based meta-heuristics for the weighted maximal planar graph
• scientific article; zbMATH DE number 844203 (Why is no real title available?)
• Local Search Algorithms for the Maximal Planar Layout Problem

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 Q4209209)