A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints
type: Item
instance of: scholarly article
title: A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints
zbMATH Open document ID: 1388.90123
author: Temel Öncan
author: İ. Kuban Altınel
publication date: 2018-04-11T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6858338
zbMATH Keywords: branch and bound
zbMATH Keywords: bipartite perfect matching problem
zbMATH Keywords: conflict graph
zbMATH Keywords: assignment problem
MaRDI profile type: Publication
full work available at URL: j.endm.2018.01.002
OpenAlex ID: W2790483745
cites work: Q3056948
cites work: Assignment Problems
cites work: Polynomially solvable special cases of the quadratic bottleneck assignment problem
cites work: The quadratic assignment problem. Theory and algorithms
cites work: Paths, trees and matchings under disjunctive constraints
cites work: Handbook of metaheuristics
cites work: The minimum cost perfect matching problem with conflict pair constraints
cites work: The NP-completeness of the bandwidth minimization problem
cites work: The Knapsack Problem with Conflict Graphs
cites work: The maximum flow problem with disjunctive constraints
cites work: The minimum spanning tree problem with conflict constraints and its variations
DOI: 10.1016/J.ENDM.2018.01.002
Recommended article: The minimum cost perfect matching problem with conflict pair constraints
Recommended article: An efficient algorithm for the bipartite matching problem
Recommended article: Finding all minimum-cost perfect matchings in Bipartite graphs
Recommended article: A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs
Recommended article: Q4607911
Recommended article: A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs
Recommended article: A branch-and-price algorithm for the bin packing problem with conflicts
Recommended article: Constrained Matching Problems in Bipartite Graphs
Recommended article: A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
Recommended article: An 0(n log n) algorithm for the convex bipartite matching problem
description: scientific article; zbMATH DE number 6858338