메뉴 건너뛰기




Volumn 2, Issue , 2003, Pages 1001-1010

Minimum power broadcast trees for wireless networks: Integer programming formulations

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; HEURISTIC METHODS; INTEGER PROGRAMMING; MATRIX ALGEBRA; MULTICASTING; EVOLUTIONARY ALGORITHMS; FORESTRY; HEURISTIC ALGORITHMS;

EID: 0042941430     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/infcom.2003.1208937     Document Type: Conference Paper
Times cited : (127)

References (9)
  • 1
    • 0033894011 scopus 로고    scopus 로고
    • On the construction of energy-efficient broadcast and multicast trees in wireless networks
    • J.E. Wieselthier, G.D. Nguyen and A. Ephremides, "On the construction of energy-efficient broadcast and multicast trees in wireless networks", IEEE INFOCOM 2000, pp. 585-594.
    • (2000) IEEE INFOCOM 2000 , pp. 585-594
    • Wieselthier, J.E.1    Nguyen, G.D.2    Ephremides, A.3
  • 6
    • 0041873837 scopus 로고
    • The traveling salesman problem
    • 1956-1, J. F. McCloskey and J. M. Coppinger (eds), Johns Hopkins Press, Baltimore, Maryland
    • Flood Merrill M., 1956-1, "The Traveling Salesman Problem," in J. F. McCloskey and J. M. Coppinger (eds), Operations Research for Management, Vol. II, Johns Hopkins Press, Baltimore, Maryland, 1956, pp. 340-357.
    • (1956) Operations Research for Management , vol.2 , pp. 340-357
    • Flood Merrill, M.1
  • 7
    • 84945708767 scopus 로고
    • Integer programming formulations of traveling salesman problems
    • October
    • Miller L. B., A. W. Tucker and R. A. Zemlin, "Integer Programming Formulations of Traveling Salesman Problems," J. Assoc. Comput. Mach., Vol. 7, No. 4, October 1960.
    • (1960) J. Assoc. Comput. Mach. , vol.7 , Issue.4
    • Miller, L.B.1    Tucker, A.W.2    Zemlin, R.A.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.