A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks
Published Online:17 Jun 2011https://doi.org/10.1287/ijoc.1110.0463
References
- Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Upper Saddle River, NJ) Google Scholar
- Solving the minimum energy broadcasting problem in ad hoc wireless networks by integer programming. Proc. 2nd Internat. Network Optim. Conf. (INOC) (2005) (University of Lisbon, Lisbon, Portugal) 635–642Google Scholar
- Analysis and computational study of several integer programming formulation for minimum-energy multicasting in wireless ad hoc networks. Networks (2008) 52(2):57–68Crossref, Google Scholar
- Localized minimum-energy broadcasting in ad-hoc networks. Proc. IEEE INFOCOM 2003 Conf. (2003) San Francisco(IEEE, Piscataway, NJ) 2210–2217Crossref, Google Scholar
- Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. ACM Mobicom Conf. (2002) Atlanta(ACM, New York) 172–182Google Scholar
- Solving large-scale zero-one linear programming problems. Oper. Res. (1983) 31(5):803–834Link, Google Scholar
- The minimum power broadcast problem in wireless networks: An ant colony system approach. IEEE CAS Workshop Wireless Comm. Networking (2002) Pasadena, CA(IEEE, Piscataway, NJ) 5–6Google Scholar
- A cluster-merge algorithm for solving the minimum power broadcast problem in large scale wireless networks. IEEE MILCOM Conf. (2003a) (IEEE Computer Society, Washington, DC) 416–421Crossref, Google Scholar
- Minimum power broadcast trees for wireless networks: Integer programming formulations. Proc. IEEE INFOCOM 2003 Conf. (2003b) San Francisco(IEEE, Piscataway, NJ) 1001–1010Crossref, Google Scholar
- Minimum-energy broadcast in simple graphs with limited node power. IASTED Internat. Conf. Parallel Distributed Comput. Systems (PDCS) (2001) Anaheim, CA(ACTA Press, Calgary, AB, Canada) 334–338Google Scholar
- Tabu Search (1997) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
- A faster algorithm for finding the minimum cut in a directed graph. J. Algorithms (1994) 17(3):424–446Crossref, Google Scholar
- Solving 0-1 integer programming problems arising from large scale planning models. Oper. Res. (1985) 33(4):803–819Link, Google Scholar
- Minimum power multicasting problem in wireless networks. Math. Methods Oper. Res. (2008) 68(2):295–311Crossref, Google Scholar
- Minimum power broadcast trees for wireless networks: Optimizing using the viability lemma. IEEE Internat. Sympos. Circuits Systems (2002) Scottsdale, AZ(IEEE, Piscataway, NJ) 273–276Crossref, Google Scholar
- , Floudas C. A., Pardalos P. M. Integer programming: Branch and cut algorithms. Encyclopedia of Optimization (2009) 2nd ed.(Springer, Berlin) 1643–1650Crossref, Google Scholar
- The minimum power broadcast problem in wireless networks: A simulated annealing approach. IEEE Wireless Comm. Networking Conf. (2005) New Orleans(IEEE, Piscataway, NJ) 2057–2062Crossref, Google Scholar
- Wireless Communications: Principles and Practice (1996) (Prentice Hall, Upper Saddle River, NJ) Google Scholar
- Internal nodes based broacasting in wireless networks. Proc. 34th Hawaii Internat. Conf. System Sci. (2001) (IEEE Computer Society, Washington, DC) 1–10Google Scholar
- Energy-efficient broadcasting and multicast trees in wireless networks. Mobile Networks Appl. (2002) 7(6):481–492Crossref, Google Scholar
- Integer Programming (1998) (John Wiley & Sons, New York) Google Scholar
- Solving minimum power broadcast problem in wireless ad-hoc networks using genetic algorithm. Annual Conf. Comm. Networks Services Res. (2008) (IEEE Computer Society, Los Alamitos, CA) 203–207Crossref, Google Scholar
- An integer programming approach for the minimuum-energy broadcasting problem in wireless networks. Proc. 2nd Internat. Network Optim. Conf. (INOC) (2005) (University of Lisbon, Lisbon, Portugal) 643–650Google Scholar

