Cycle decomposition, Steiner trees, and the facility layout problem
The facility layout problem is modelled as a cycle decomposition process in which the maximum-weight clique and travelling salesman problems are utilized to extract cycles from the graph adjacency matrix. The space between cycles is triangulated so the graph is maximally planar. The adjacency graph...
| Main Author: | |
|---|---|
| Language: | ENG |
| Published: |
ScholarWorks@UMass Amherst
2003
|
| Subjects: | |
| Online Access: | https://scholarworks.umass.edu/dissertations/AAI3110541 |