Skip to main content
SpringerLink
Log in

Broadcast Scheduling Problem

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Synonyms

Introduction

  Organization

  Idiosyncrasies

Formulation

Methods

  Sequential Vertex Coloring

  Mixed Neural-Genetic Algorithm

  Greedy Randomized Adaptive Search Procedures (GRASP)

  Multi-start Combinatorial Algorithm

  Computational Effectiveness

Conclusion

See also

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Akyildiz IF, Wang X, Wang W (2005) Wireless mesh networks: a survey. Comp Network 47(4):445–487

    Article  MATH  Google Scholar 

  2. Commander CW, Butenko SI, Pardalos PM (2004) On the performance of heuristics for broadcast scheduling. In: Grundel D, Murphey R, Pardalos P (eds) Theory and Algorithms for Cooperative Systems. World Scientific, Singapore, pp 63–80

    Google Scholar 

  3. Commander CW, Butenko SI, Pardalos PM, Oliveira CAS (2004) Reactive grasp with path relinking for the broadcast scheduling problem. In: Proceedings of the 40th Annual International Telemetry Conference. pp 792–800

    Google Scholar 

  4. Commander CW, Festa P, Oliveira CAS, Pardalos PM, Resende MGC, Tsitselis M (2006) GRASP with path-relinking for the cooperative communication problem on ad-hoc networks. SIAM J Control Optim submitted

    Google Scholar 

  5. Commander CW, Oliveira CAS, Pardalos PM, Resende MGC (2005) A GRASP heuristic for the cooperative communication problem in ad hoc networks. In: Proceedings of the VI Metaheuristics International Conference. pp 225–230

    Google Scholar 

  6. Commander CW, Pardalos PM (2007) A combinatorial algorithm for the TDMA message scheduling problem. Comput Optim Appl to appear

    Google Scholar 

  7. Darwin C (1872) The Origin of Species, 6th edn. Murray, London

    Google Scholar 

  8. Ephremides A, Truong TV (1990) Scheduling broadcasts in multihop radio networks. IEEE Trans Commun 38(4):456–460

    Article  Google Scholar 

  9. Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Global Optim 6:109–133

    Article  MathSciNet  MATH  Google Scholar 

  10. Festa P, Resende MGC (2002) GRASP: An annotated bibliography. In: Ribeiro C, Hansen P (eds) Essays and surveys in metaheuristics, Kluwer, Dordrecht, pp 325–367

    Google Scholar 

  11. Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman WH and Company, New York

    MATH  Google Scholar 

  12. Goldberg DE (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Kluwer, Dordrecht

    MATH  Google Scholar 

  13. Hajek B, Sasaki G (1988) Link scheduling in polynomial time. IEEE Trans Inf Theor 34:910–918

    Article  MathSciNet  Google Scholar 

  14. Hillier FS, Lieberman GJ (2001) Introduction to Operations Research. McGraw Hill, New York

    Google Scholar 

  15. Hopfield JJ, Tank DW (1982) Neural networks and physical systems with emergent collective computational abilities. In: Proceedings of the National Academy of Science, pp 2541–2554

    Google Scholar 

  16. Horst R, Pardalos PM, Thoai NV (1995) Introduction to Global Optimization, volume 3 of Nonconvex Optimization and its Applications. Kluwer, Dordrecht

    Google Scholar 

  17. Dash Optimization Inc (2003) Xpress-Optimizer Reference Manual

    Google Scholar 

  18. King J (1994) Three problems in search of a measure. Am Math Mon 101:609–628

    Article  MATH  Google Scholar 

  19. Kleinrock L, Silvester J (1987) Spatial reuse in multihop packet radio networks. In: Proceedings of the IEEE 75

    Google Scholar 

  20. Laguna M, Martí R (2001) A grasp for coloring sparse graphs. Comput Optim Appl 19(2):165–178

    Article  MathSciNet  MATH  Google Scholar 

  21. Li Y, Pardalos PM, Resende MGC (1994) A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic Assignment and Related Problems, volume 16 of DIMACS Series on DIscrete Mathematics and Theoretical Computer Science, pp 237–261

    Google Scholar 

  22. Oliveira CAS, Pardalos PM, Querido TM (2005) A combinatorial algorithm for message scheduling on controller area networks. Int J Oper Res 1(1/2):160–171

    Article  MATH  Google Scholar 

  23. Oliveira CAS, Pardalos PM, Resende MGC (2003) Grasp with path-relinking for the qap. In: 5th Metaheuristics International Conference, pp 57.1–57.6

    Google Scholar 

  24. Resende MGC, Feo TA (1996) A grasp for satisfiability. In: Johnson DS, Trick MA (eds) Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenges, volume 26, American Mathematical Society, Providence, RI, pp 499–520

    Google Scholar 

  25. Resende MGC, Pardalos PM (2006) Handbook of Optimization in Telecommunications. Springer, Berlin

    MATH  Google Scholar 

  26. Resende MGC, Ribeiro CC (2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger G (eds) Handbook of Metaheuristics. Kluwer, Dordrecht, pp 219–249

    Chapter  Google Scholar 

  27. Salcedo-Sanz S, Busoño-Calzón C, Figueiral-Vidal AR (2003) A mixed neural-genetic algorithm for the broadcast scheduling problem. IEEE Trans Wirel Commun 2(2):277–283

    Article  Google Scholar 

  28. Wang G, Ansari N (1997) Optimal broadcast scheduling in packet radio networks using mean field annealing. IEEE J Sel Areas Commun 15(2):250–260

    Article  Google Scholar 

  29. Watanabe Y, Mizuguchi N, and Fujii Y (1998) Solving optimization problems by using a hopfield neural network and genetic algorithm combination. Syst Comput Jpn 29(10):68–73

    Article  Google Scholar 

  30. Wolsey L (1998) Integer Programming. Wiley, New York

    MATH  Google Scholar 

  31. Yeo J, Lee H, and Kim S (2002) An efficient broadcast scheduling algorithm for TDMA ad-hoc networks. Comput Oper Res 29:1793–1806

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Air Force Research Laboratory, Munitions Directorate, and Dept. of Industrial and Systems Engineering, University of Florida, Gainesville, USA

    Clayton W. Commander

Authors
  1. Clayton W. Commander
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Commander, C.W. (2008). Broadcast Scheduling Problem . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_60

Download citation

Publish with us

Policies and ethics

Search

Navigation