Two graph-theoretic procedures for an improved solution to the facilities layout problem (Q3354559): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207549108948041 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997409776 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Construction properties of combinatorial deltahedra / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The facility layout problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Efficiency of Computer Algorithms for Plant Layout / rank | |||
Normal rank | |||
Latest revision as of 16:57, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two graph-theoretic procedures for an improved solution to the facilities layout problem |
scientific article |
Statements
Two graph-theoretic procedures for an improved solution to the facilities layout problem (English)
0 references
1991
0 references
0 references
0 references
