With the rapid development of Web 2.0 and Online To Offline (O2O) marketing model,
various online event-based social networks (EBSNs) are getting popular. An important task …

We study the minimum spanning tree problem, the maximum matching problem and the
shortest path problem subject to binary disjunctive constraints: A negative disjunctive …

With the rapid development of Web 2.0 and Online To Offline (O2O) marketing model,
various online event-based social networks (EBSNs), such as Meetup and Whova, are …

Deep learning has achieved great success in various real-world applications. As deep
neural networks (DNNs) are getting larger, the inference and training cost of DNNs …

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 …

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 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 …

We study approaches for the exact solution of the NP-hard minimum spanning tree problem
under conflict constraints. Given a graph G (V, E) G (V, E) and a set C ⊂ E * EC⊂ E× E of …

This article addresses the minimum spanning tree problem with conflicting edge pairs, a
variant of the classical minimum spanning tree where, given a list of conflicting edges, the …