An interactive layout heuristic based on hexagonal adjacency graphs
type: Item
instance of: scholarly article
title: An interactive layout heuristic based on hexagonal adjacency graphs
zbMATH Open document ID: 0825.90473
DOI: 10.1016/0377-2217(92)90033-6
published in: European Journal of Operational Research
publication date: 1993-04-01T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 148028
author: Marc Goetschalckx
MaRDI profile type: Publication
full work available at URL: 0377-2217(92)90033-6
OpenAlex ID: W2062148030
cites work: DISCON: A New Method for the Layout Problem
cites work: A Heuristic Procedure for the Layout of a Large Number of Facilities
cites work: Q4750667
cites work: Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
cites work: A Strategy for Solving the Plant Layout Problem
cites work: Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Q4294590
cites work: SHAPE: A construction algorithm for area placement evaluation
cites work: Efficient Planarity Testing
cites work: Assignment Problems and the Location of Economic Activities
cites work: The facility layout problem
cites work: The quadratic assignment problem
cites work: P-Complete Approximation Problems
cites work: Q5616606
cites work: Q3693257
description: scientific article; zbMATH DE number 148028