cut strengthening

Computational evaluation of cut-strengthening techniques in logic-based Benders’ decomposition

  • Aigerim Saken
  • Emil Karlsson
  • Stephen J. Maher
  • Elina Rönnberg
    • Categories Applications - OR and Management Sciences, Combinatorial Optimization, Scheduling Tags , , , , ,

    Cut-strengthening techniques have a significant impact on the computational effectiveness of the Logic-based Benders’ decomposition (LBBD) scheme. While there have been numerous cut-strengthening techniques proposed, very little is understood about which techniques achieve the best computational performance for the LBBD scheme. This is typically due to implementations of LBBD being problem specific and thus, no … Read more

    Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling

  • Emil Karlsson
  • Elina Rönnberg
    • Categories (Mixed) Integer Linear Programming Tags , , , , ,

    Pre-runtime scheduling of large-scale electronic systems, as those in modern aircraft, can be computationally challenging. In this paper, we study a distributed integrated modular avionic system of practical relevance where the scheduling includes to assign communication messages to time slots and to sequence tasks on modules. For this problem, the challenge is the huge number … Read more

    A disjunctive cut strengthening technique for convex MINLP

  • Jan Kronqvist
  • Ruth Misener
    • Categories (Mixed) Integer Nonlinear Programming, Cutting Plane Approaches Tags , , ,

    Generating polyhedral outer approximations and solving mixed-integer linear relaxations remains one of the main approaches for solving convex mixed-integer nonlinear programming (MINLP) problems. There are several algorithms based on this concept, and the efficiency is greatly affected by the tightness of the outer approximation. In this paper, we present a new framework for strengthening cutting … Read more