Anke Schmeink

The Multi-Band Robust Knapsack Problem — A Dynamic Programming Approach —

  • Grit Claßen
  • Arie M.C.A. Koster
  • Anke Schmeink
    • Categories Robust Optimization Tags , ,

    In this paper, we consider the multi-band robust knapsack problem which generalizes the Γ-robust knapsack problem by subdividing the single deviation band into several smaller bands. We state a compact ILP formulation and develop two dynamic programming algorithms based on the presented model where the first has a complexity linear in the number of items … Read more

    Planning Wireless Networks with Demand Uncertainty using Robust Optimization

  • Grit Claßen
  • Arie M.C.A. Koster
  • Anke Schmeink
    • Categories Robust Optimization, Telecommunications Tags , ,

    An optimal planning of future wireless networks is fundamental to satisfy rising traffic demands jointly with the utilization of sophisticated techniques, such as OFDMA. Current methods for this task require a static model of the problem. However, uncertainty of data arises frequently in wireless networks, e. g., fluctuat- ing bit rate requirements. In this paper, … Read more