| dc.creator |
Helme, Marcia P. |
|
| dc.creator |
Magnanti, Thomas L. |
|
| dc.date |
2004-05-28T19:36:28Z |
|
| dc.date |
2004-05-28T19:36:28Z |
|
| dc.date |
1987-01 |
|
| dc.date.accessioned |
2013-10-09T02:39:23Z |
|
| dc.date.available |
2013-10-09T02:39:23Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/5376 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
In satellite communications networks, distinctive facilities called homing stations perform special transmission functions. Local demand nodes clustered around each homing station communicate with each other via a local switch at the homing station; demand nodes in different clusters communicate with each other via satellite earth stations at the homing stations. Designing such a communication network requires choices on the locations of the earth stations and on the assignments of demand nodes to the local clusters at the earth stations. We formulate this problem as a zero-one quadratic facility location problem and transform it into an equivalent zero-one integer linear program. Computational experience on real data shows that a branch and bound procedure is effective in solving problems with up to forty demand nodes (major cities) and that the solutions that this algorithm finds improve considerably upon management generated solutions. We also show that a greedy add heuristic, as implemented on an IBM PC, consistently generates optimal or near-optimal solutions. |
|
| dc.format |
2195334 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Massachusetts Institute of Technology, Operations Research Center |
|
| dc.relation |
Operations Research Center Working Paper;OR 159-87 |
|
| dc.title |
Designing Satellite Communication Networks by Zero-One Quadratic Programming |
|
| dc.type |
Working Paper |
|