## Abstract

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 bipartite graph with a cost associated with each edge and a conflict set of edge pairs, the assignment problem with conflict constraints corresponds to finding a minimum weight perfect matching without any conflicting edge pair. For example, some chemicals cannot be processed on close processors, food and toxic products cannot be stored neighboring locations at the same storage area, and machines cannot be sent to process jobs without satisfying some spatial constraints. Unlike the well-known assignment problem, this problem is NP-hard. We first introduce a realistic special class and demonstrate its polynomial solvability. Then, we propose a Branch-and-Bound algorithm and a Russian Doll Search algorithm using the assignment problem relaxations for lower bound computations, and introduce combinatorial branching rules based on the conflicting edges in an optimal solution of the relaxations. According to the extensive computational experiments we can say that the proposed algorithms are very efficient.

Original language | English |
---|---|

Pages (from-to) | 214-229 |

Number of pages | 16 |

Journal | Computers & Operations Research |

Volume | 111 |

DOIs | |

Publication status | Published - Nov 2019 |

Externally published | Yes |

## Keywords

- Assignment Problem
- Integer programming
- Branch and bound
- Conflicts
- Branch-and-bound
- Assignment problem