Atefeh Rajabalizadeh

Solving a Class of Cut-Generating Linear Programs via Machine Learning

  • Danial Davarnia
  • Atefeh Rajabalizadeh
    • Categories Branch and Cut Algorithms, Data-Mining, Linear Programming Tags , , , ,

    Cut-generating linear programs (CGLPs) play a key role as a separation oracle to produce valid inequalities for the feasible region of mixed-integer programs. When incorporated inside branch-and-bound, the cutting planes obtained from CGLPs help to tighten relaxations and improve dual bounds. However, running the CGLPs at the nodes of the branch-and-bound tree is computationally cumbersome … Read more

    Achieving Consistency with Cutting Planes

  • Danial Davarnia
  • Atefeh Rajabalizadeh
  • John Hooker
    • Categories 0-1 Programming, Cutting Plane Approaches Tags , , , ,

    Cutting planes accelerate branch-and-bound search primarily by cutting off fractional solutions of the linear programming (LP) relaxation, resulting in tighter bounds for pruning the search tree. Yet cutting planes can also reduce backtracking by excluding inconsistent partial assignments that occur in the course of branching. A partial assignment is inconsistent with a constraint set when … Read more