Two new heuristic algorithms for the maximal planar layout problem

DOI10.1007/BF01545513zbMath0889.90147OpenAlexW2020015381MaRDI QIDQ1374393

Gerhard Wäscher, Jürgen Merker

Publication date: 22 June 1998

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01545513

zbMATH Keywords

adjacency problemfacility layout planningtriangulation expansion heuristics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Location and layout planning. A survey

Cites Work

• Unnamed Item
• Unnamed Item
• ADD-heuristics' starting procedures for capacitated plant location models
• Two graph-theoretic procedures for an improved solution to the facilities layout problem
• Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
• A New Graph-Theoretic Heuristic for Facility Layout
• TESSA—A new greedy heuristic for facilities layout planning
• A comparative evaluation of heuristics forthe adjacency problem in facility layout planning
• Local Search Algorithms for the Maximal Planar Layout Problem

This page was built for publication: Two new heuristic algorithms for the maximal planar layout problem