2006 | OriginalPaper | Buchkapitel
Integer Programming for Telecommunications
verfasst von : Eva K. Lee, David P. Lewis
Erschienen in: Handbook of Optimization in Telecommunications
Verlag: Springer US
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This chapter presents an overview of integer programming in the field of telecommunications. Various integer programming models are described, and computational strategies for solving the integer programming instances are summarized. Techniques such as branching variable selection and node selection schemes are discussed; and the concepts of problem preprocessing and reformulation, heuristics, and continuous reduced-cost fixing are outlined. These latter techniques have been shown to be very effective when embedded within a branch-and-bound algorithm. The use of an interior point method as a subproblem solver is also described. Finally, Lagrangian relaxation in the context of solving specific telecommunication instances is analyzed as an alternative relaxation for use within the branch-and-bound tree search environment.