EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

4039. Generating cuts with phantom branching

Invited abstract in session WA-4: Algorithms for Mixed-Integer Nonlinear Programming and Nonconvex Optimization, stream MINLP.

Wednesday, 8:30-10:00
Room: 1001 (building: 202)

Authors (first author is the speaker)

1. Yehor Blokhin
Mathematics, KTH Royal Institute of Technology
2. Jan Kronqvist
Mathematics, KTH Royal Institute of Technology

Abstract

We consider a strategy for generating cuts for set partitioning and set packing constraints. We perform an exploitative wide branching to detect infeasible and suboptimal integer combinations and tighten continuous relaxation. The idea originates from results that even restarting branch-and-bound solver can be beneficial fo overall performance.

Keywords

Status: accepted


Back to the list of papers