logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

An algorithm of global optimization for solving layout problems

delete1999-04-01
delete31
PRE
AI
E
Enmin Feng *
X
Xilu Wang
X
Xiumei Wang
H
Hong‐Fei Teng
DOI：10.1016/S0377-2217(98)00011-3delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The two-dimensional layout problem is known to be NP-complete, and the current research work is basically in the heuristic way. In this paper, we mainly discuss the methods for solving layout problem about the artificial satellite module by virtue of graph theory and group theory. Also, an algorithm of global optimization is presented first time. The method given here can be extended to solve other type of layout problems. (C) 1999 Elsevier Science B.V. All rights reserved.
Keywords:
packing
optimal algorithm
symmetry group
equivalent relation
isomorphism
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

No organization information available