6 papers
On Solving the Assignment Problem with Conflicts
Roberto Montemanni, Derek H. Smith
A variant of the well-known Assignment Problem is studied in this paper, where pairs of assignments are conflicting, and cannot be selected at the same time. This configures a set…
On Solving the Knapsack Problem with Conflicts
Roberto Montemanni, Derek H. Smith
A variant of the well-known Knapsack Problem is studied in this paper, where pairs of items are conflicting, and cannot be selected at the same time. This configures a set of hard…
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts
Roberto Montemanni, Derek H. Smith
A variant of the well-known Shortest Path Problem is studied in this paper, where pairs of conflicting arcs are provided, and for each conflicting pair a penalty is paid once neith…
On Solving the Set Covering Problem with Conflicts on Sets
Roberto Montemanni, Derek H. Smith
A variant of the well-known Set Covering Problem is studied in this paper, where subsets of a collection have to be selected, and pairwise conflicts among subsets of items exist. T…
On Solving the Minimum Spanning Tree Problem with Conflicting Edge Pairs
Roberto Montemanni, Derek H. Smith
The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-wo…
On Solving the Maximum Flow Problem with Conflict Constraints
Roberto Montemanni, Derek H. Smith
The Maximum Flow Problem with Conflict Constraints is a generalization that adds conflict constraints to a classical optimization problem on networks used to model several real-wor…