Doi: 10. 1016/S0305-0548(03)00202-8

Document Outline

• Cost-optimal topology planning of hierarchicalaccess networks
  • Introduction
  • Problem definition
    • Network model
    • Input
    • Output
    • Problem formulation
    • Complexity
  • State-of-the-art
  • Application example
  • Algorithm
    • Operations
      • Basic operations
      • Compound operations
    • Algorithms for initial solution
      • Top-down
      • TreePlan
      • Random
    • Algorithms for improvement phase
    • Enhancements
      • Neighborhood lists
      • Calculating cost-difference
  • Numerical results
    • Problem instance generation
    • Running time
      • Initial solution
      • Full algorithm variants
    • Algorithm comparison
    • Robustness
      • Continuous cost
      • Modified constraints
      • Equivalent nodes
  • Conclusions and further work
  • Acknowledgements
  • Appendix A. Procedure pseudocodes
    • Procedure Cluster (P,Kmin,l)
    • Procedure Tree (P,root,l)
    • Procedure Moves (C,P)
    • Procedure Moves, cost-difference calculation in Step 3c
    • Procedure Swaps (C)
    • Procedure Recluster(r,malloc, mlocopt)
    • Procedure ReclusterLevel (l,malloc,mlocopt)
    • Procedure LocalOpt (l, ByRoots)
    • Procedure Top-Down-IniSol(N)
    • Procedure Random-IniSol (N)
    • Procedure Full-Iteration-Improvement (N-, UseClu, UseLoc)
  • References