The maximum-cut problem is one of the fundamental problems in combinatorial
optimization. With the advent of quantum computers, both the maximum-cut and the …

In this paper, a new method for computing an enclosure of the nondominated set of
multiobjective mixed-integer quadratically constrained programs without any convexity …

This paper explores reoptimization techniques for solving sequences of similar mixed
integer programs (MIPs) more effectively. Traditionally, these MIPs are solved …

Numerous web applications rely on solving combinatorial optimization problems, such as
energy cost-aware scheduling, budget allocation on web advertising, and graph matching …

Abstract Mixed Integer Programming (MIP) is NP-hard, and yet modern solvers often solve
large real-world problems within minutes. This success can partially be attributed to …

Mixed-Integer Linear Programs (MILPs) have many practical applications. Most modelling
tools for MILPs fall in two broad categories. Indeed, tools such as algebraic modelling …

This note comments on the study of [Diri Kenger, Zülal, Çağrı Koç, and Eren Özceylan.
2020.“Integrated Disassembly Line Balancing and Routing Problem.” International Journal …

The generation of strong linear inequalities for QCQPs has been recently tackled by a
number of authors using the intersection cut paradigm—a highly studied tool in integer …

The verification of deep neural networks is a recent algorithmic challenge that has attracted
significant interest, resulting in a wide array of complete and incomplete solvers that draw on …

We consider a novel variant of the heterogeneous vehicle routing problem (VRP) in which
each customer has different availability time windows for every vehicle. In particular, this …