The labeled maximum matching problem

DOI10.1016/j.cor.2008.05.012zbMath1179.90318OpenAlexW2075574301MaRDI QIDQ1000970

Francesco Carrabs, Raffaele Cerulli, Monica Gentili

Publication date: 12 February 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.05.012

zbMATH Keywords

matchingbranch and boundcolorexact approachlabel

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Comparison of metaheuristics for the k‐labeled spanning forest problem ⋮ The rainbow Steiner tree problem ⋮ Two heuristics for the rainbow spanning forest problem ⋮ Minimum <scp>color‐degree</scp> perfect b‐matchings ⋮ Bi-criteria and approximation algorithms for restricted matchings ⋮ On the complexity of rainbow spanning forest problem ⋮ A hybrid metaheuristic for the minimum labeling spanning tree problem ⋮ Uncertain vertex coloring problem ⋮ Maximum matchings of a digraph based on the largest geometric multiplicity ⋮ The rainbow spanning forest problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The labeled perfect matching in bipartite graphs
• The minimum labeling spanning trees
• On the minimum label spanning tree problem
• Local search for the minimum label spanning tree problem with bounded color classes.
• A note on the minimum label spanning tree.
• Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
• Comparison of heuristics for the colourful travelling salesman problem
• Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
• The Colorful Traveling Salesman Problem
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
• Spanning trees with many or few colors in edge-colored graphs
• Paths, Trees, and Flowers
• Algorithms and Computation

This page was built for publication: The labeled maximum matching problem