Integer programming formulations for the minimum weighted maximal matching problem
type: Item
instance of: scholarly article
title: Integer programming formulations for the minimum weighted maximal matching problem
zbMATH Open document ID: 1254.90130
author: Z. Caner Taşkın
author: Tınaz Ekim
published in: Optimization Letters
publication date: 2012-11-07T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 91B68
zbMATH DE Number: 6102949
zbMATH Keywords: minimum maximal matching
zbMATH Keywords: edge dominating set
zbMATH Keywords: integer programming
MaRDI profile type: Publication
full work available at URL: s11590-011-0351-x
OpenAlex ID: W2075081186
cites work: Approximability of the capacitated \(b\)-edge dominating set problem
cites work: Q3145799
cites work: Computing and Combinatorics
cites work: Improved approximation bounds for edge dominating set in dense graphs
cites work: Approximation hardness of edge dominating set problems
cites work: Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
cites work: Paths, Trees, and Flowers
cites work: A 2-approximation algorithm for the minimum weight edge dominating set problem
cites work: Minimum Edge Dominating Sets
cites work: The edge domination problem
cites work: Q3870917
cites work: Minimum-maximal matching in series-parallel graphs
cites work: Improving Discrete Model Representations via Symmetry Considerations
cites work: A global optimization method for minimum maximal flow problem
cites work: Edge domination on bipartite permutation graphs and cotriangulated graphs
cites work: Edge Dominating Sets in Graphs
DOI: 10.1007/S11590-011-0351-X
description: scientific article; zbMATH DE number 6102949