A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Electron. Notes Discret. Math.

• Publication date

  2018-02-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.endm.2018.01.002
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Iterated Local Search: Framework and Applications

  2018cited by this paper
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph

  2017cited by this paper
• Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm

  2013cited by this paper
• The minimum cost perfect matching problem with conflict pair constraints

  2013cited by this paper
• Paths, trees and matchings under disjunctive constraints

  2011cited by this paper
• The maximum flow problem with disjunctive constraints

  2011cited by this paper
• The minimum spanning tree problem with conflict constraints and its variations

  2011cited by this paper
• Polynomially solvable special cases of the quadratic bottleneck assignment problem

  2011cited by this paper
• The quadratic assignment problem : theory and algorithms

  1999cited by this paper
• Assignment Problems

  1998cited by this paper
• Network Flows: Theory, Algorithms, and Applications

  1993cited by this paper
• The NP-Completeness of the bandwidth minimization problem

  1976cited by this paper
• Journal of Graph Algorithms and Applications the Knapsack Problem with Conflict Graphs

  year unknowncited by this paper

• An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints

  2025cites this paper
• On Solving the Knapsack Problem with Conflicts

  2025cites this paper
• On Solving the Minimum Spanning Tree Problem with Conflicting Edge Pairs

  2025cites this paper
• Advanced Kernel Search approach for the MST Problem with conflicts involving affinity detection and initial solution construction

  2024cites this paper
• Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP

  2024cites this paper
• Maximum weight perfect matching problem with additional disjunctive conflict constraints

  2022cites this paper
• Minimum cost flow problem with conflicts

  2021cites this paper
• Efficient Matching of Multi-Modal Sensing Nodes for Collaborative Sense Optimization of Composite Events

  2019cites this paper
• A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs

  2019cites this paper
• Assignment problem with conflicts

  2019cites this paper