The Network Packing Problem in Terrestrial Broadcasting
Author
Abstract
Suggested Citation
DOI: 10.1287/opre.1060.0312
Download full text from publisher
References listed on IDEAS
- Kumar Rajaram & Reza Ahmadi, 2003. "Flow Management to Optimize Retail Profits at Theme Parks," Operations Research, INFORMS, vol. 51(2), pages 175-184, April.
- F. Rossi & S. Smriglio & A. Sassano, 2001. "Models and Algorithms for Terrestrial Digital Broadcasting," Annals of Operations Research, Springer, vol. 107(1), pages 267-283, October.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
- C. Mannino & S. Mattia & A. Sassano, 2011. "Planning wireless networks by shortest path," Computational Optimization and Applications, Springer, vol. 48(3), pages 533-551, April.
- Fabio D'Andreagiovanni & Carlo Mannino & Antonio Sassano, 2010. "GUB Covers and Power-Indexed Formulations for Wireless Network Design," DIS Technical Reports 2010-14, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
- Fabio D'Andreagiovanni & Carlo Mannino & Antonio Sassano, 2009. "A Power-Indexed Formulation for Wireless Network Design," DIS Technical Reports 2009-14, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Linze Chen & Junhan Liu & Yang Zhao, 2023. "Innovation and Development: An Analysis of Landscape Construction Factors in Quanzhou Maritime Silkroad Art Park," Sustainability, MDPI, vol. 15(4), pages 1-22, February.
- Edoardo Amaldi & Raphael Hauser, 2005. "Boundedness Theorems for the Relaxation Method," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 939-955, November.
- Fotiadis, Anestis K., 2016. "Modifying and applying time and cost blocks: The case of E-Da theme park, Kaohsiung, Taiwan," Tourism Management, Elsevier, vol. 54(C), pages 34-42.
- Carlo Mannino & Sara Mattia & Antonio Sassano, 2009. "Planning Wireless Networks by Shortest Path," DIS Technical Reports 2009-02, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
- Feng Qiu & Shabbir Ahmed & Santanu S. Dey & Laurence A. Wolsey, 2014. "Covering Linear Programming with Violations," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 531-546, August.
- Zhang, Yingsha & Li, Xiang (Robert) & Su, Qin & Hu, Xingbao, 2017. "Exploring a theme park's tourism carrying capacity: A demand-side analysis," Tourism Management, Elsevier, vol. 59(C), pages 564-578.
- Rutger D. van Oest & Harald J. van Heerde & Marnik G. Dekimpe, 2010. "Return on Roller Coasters: A Model to Guide Investments in Theme Park Attractions," Marketing Science, INFORMS, vol. 29(4), pages 721-737, 07-08.
- Alexander, Matthew & MacLaren, Andrew & O’Gorman, Kevin & White, Christopher, 2012. "Priority queues: Where social justice and equity collide," Tourism Management, Elsevier, vol. 33(4), pages 875-884.
More about this item
Keywords
communications: frequency and power assignment; integer programming; heuristic: neighborhood search;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:54:y:2006:i:4:p:611-626. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.