Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5377Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Balakrishnan, Anantaram | - |
| dc.creator | Magnanti, Thomas L. | - |
| dc.creator | Mirchandani, Prakash | - |
| dc.date | 2004-05-28T19:36:32Z | - |
| dc.date | 2004-05-28T19:36:32Z | - |
| dc.date | 1993-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/5377 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | We study a class of models, known as overlay optimization problems, with a "base" subproblem and an "overlay" subproblem, linked by the requirement that the overlay solution be contained in the base solution. In some telecommunication settings, a feasible base solution is a spanning tree and the overlay solution is an embedded Steiner tree (or an embedded path). For the general overlay optimization problem, we describe a heuristic solution procedure that selects the better of two feasible solutions obtained by independently solving the base and overlay subproblems, and establish worst-case performance guarantees on both this heuristic and a linear programming relaxation of the model. These guarantees depend upon worst-case bounds for the heuristics and linear programming relaxations of the unlinked base and overlay problems. Under certain assumptions about the cost structure and the optimality of the subproblem solutions, the performance guarantees for both the heuristic and linear programming relaxation of the combined overlay optimization model are 33%. We also develop heuristic and linear programming performance guarantees for specialized models, including a dual path connectivity model with a worst-case performance guarantee of 25%, and an uncapacitated multicommodity network design model with a worst-case performance guarantee (approximately) proportional to the square root of the number of commodities. | - |
| dc.format | 4732600 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 275-93 | - |
| dc.title | Heuristics, LPs, and Generalizations of Trees on Trees | - |
| dc.type | Working Paper | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.