H. Georg Büsching

Improving the LP bound of a MILP by dual concurrent branching and the relationship to cut generation methods

  • H. Georg Büsching
    • Categories (Mixed) Integer Linear Programming, Branch and Cut Algorithms, Cutting Plane Approaches Tags ,

    In this paper branching for attacking MILP is investigated. Under certain circumstances branches can be done concurrently. By introducing a new calculus it is shown there are restrictions for dual values. As a second result of this study a new class of cuts for MILP is found, which are defined by those values. This class … Read more

    Improving the LP bound of a MILP by dual concurrent branching and the relationship to cut generation methods

  • H. Georg Büsching
    • Categories (Mixed) Integer Linear Programming, Cutting Plane Approaches Tags

    In this paper branching for attacking MILP is investigated. Under certain circumstances branches can be done concurrently. By introducing a new calculus it is shown there are restrictions for certain dual values and reduced costs. As a second unexpected result of this study a new class of cuts for MILP is found, which are defined … Read more