This paper studies a 3D multiplayer reach-avoid differential game with a goal region and a
play region. Multiple pursuers defend the goal region by consecutively capturing multiple …

In direct marketing, companies use sales campaigns to target their customers with
personalized product offers. The effectiveness of direct marketing greatly depends on the …

We study the classical 0–1 knapsack problem with additional restrictions on pairs of items. A
conflict constraint states that from a certain pair of items at most one item can be contained in …

This work introduces a novel extension of the 0/1 Knapsack Problem in which we consider
the existence of so-called forfeit sets. A forfeit set is a subset of items of arbitrary cardinality …

In this paper, we show a branch-and-cut approach to solve the minimum spanning tree
problem with conflicting edge pairs. This is a NP-hard variant of the classical minimum …

We focus on an extension of the assignment problem with additional conflict (pair)
constraints in conjunction with the assignment constraints and binary restrictions. Given a …

We study the maximum flow problem subject to binary disjunctive constraints in a directed
graph: A negative disjunctive constraint states that a certain pair of arcs in a digraph cannot …

The emergence of specialized hardware, such as quantum computers and Digital/CMOS
annealers, and the slowing of performance growth of general-purpose hardware raises an …

We introduce a new, remarkably powerful tool to the toolbox of algebraic FPT algorithms,
determinantal sieving. Given a polynomial P (x 1,…, xn) over a field 𝔽 of characteristic 2, on …

We consider a variant of the maximum flow problem on a given directed graph where some
arc pairs are incompatible or conflicting; in other words, they are not allowed to carry positive …