The minimum cost perfect matching problem with conflict pair constraints
From MaRDI portal
Publication:340285
DOI10.1016/j.cor.2012.10.022zbMath1349.90822OpenAlexW1977673015MaRDI QIDQ340285
Ruonan Zhang, Temel Öncan, Abraham P. Punnen
Publication date: 14 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.10.022
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (15)
Optimal base complexes for quadrilateral meshes ⋮ Matching-based capture strategies for 3D heterogeneous multiplayer reach-avoid differential games ⋮ Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach ⋮ Set covering problem with conflict constraints ⋮ Minimum cost noncrossing flow problem on layered networks ⋮ Minimum cost flow problem with conflicts ⋮ A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs ⋮ Maximum weight perfect matching problem with additional disjunctive conflict constraints ⋮ A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints ⋮ Maximum weighted matching with few edge crossings for 2-layered bipartite graph ⋮ A branch and cut algorithm for minimum spanning trees under conflict constraints ⋮ Approximation of knapsack problems with conflict and forcing graphs ⋮ Assignment problem with conflicts ⋮ Exact solution algorithms for the maximum flow problem with additional conflict constraints ⋮ Maximum matchings of a digraph based on the largest geometric multiplicity
This page was built for publication: The minimum cost perfect matching problem with conflict pair constraints
