binary program

On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs

  • Max Gläser
  • Marc E. Pfetsch
    • Categories Branch and Cut Algorithms Tags , ,

    We investigate the complexity of finding small branch-and-bound trees using variable disjunctions. We first show that it is not possible to approximate the size of a smallest branch-and-bound tree within a factor of 2^(1/5) in time 2^(\delta n) with \delta < 1/5, unless the strong exponential time hypothesis fails. Similarly, for any \varepsilon > 0, … Read more

    Building Load Control using Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty and the Risk-Adjustable Variants

  • Yiling Zhang
  • Jin Dong
    • Categories 0-1 Programming, Robust Optimization Tags , , , ,

    Aggregation of heating, ventilation, and air conditioning (HVAC) loads can provide reserves to absorb volatile renewable energy, especially solar photo-voltaic (PV) generation. However, the time-varying PV generation is not perfectly known when the system operator decides the HVAC control schedules. To consider the unknown uncertain PV generation, in this paper, we formulate a distributionally robust … Read more