Decomposition algorithms for solving the minimum weight maximal matching problem
From MaRDI portal
Recommendations
- New algorithms for maximum weight matching and a decomposition theorem
- Integer programming formulations for the minimum weighted maximal matching problem
- Maximal matching polytope in trees
- A decomposition theorem for maximum weight bipartite matchings
- A modified decomposition algorithm for maximum weight bipartite matching and its experimental evaluation
Cites work
- A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem
- A 2-approximation algorithm for the minimum weight edge dominating set problem
- A Benders decomposition approach for the robust spanning tree problem with interval data
- A survey on Benders decomposition applied to fixed-charge network design problems
- An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
- Approximability of the capacitated \(b\)-edge dominating set problem
- Approximating edge dominating set in dense graphs
- Approximation hardness of edge dominating set problems
- Benders decomposition for large-scale uncapacitated hub location
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network
- Disjunctive decomposition for two-stage stochastic mixed-binary programs with generalized upper bound constraints
- Edge Dominating Sets in Graphs
- Edge domination on bipartite permutation graphs and cotriangulated graphs
- Exact Algorithms for Edge Domination
- scientific article; zbMATH DE number 3674114 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1452998 (Why is no real title available?)
- Integer programming formulations for the minimum weighted maximal matching problem
- Minimum Edge Dominating Sets
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
- Minimum-maximal matching in series-parallel graphs
- On approximability of the independent/connected edge dominating set problems
- On two techniques of combining branching and treewidth
- Partitioning procedures for solving mixed-variables programming problems
- Paths, Trees, and Flowers
- The edge domination problem
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
Cited in
(16)- Minimum-maximal matching in series-parallel graphs
- Integer programming formulations for the minimum weighted maximal matching problem
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Minimum cost b-matching problems with neighborhoods
- Modelling and solving the perfect edge domination problem
- A decomposition theorem for maximum weight bipartite matchings
- Maximal matching polytope in trees
- The partitioning min-max weighted matching problem
- scientific article; zbMATH DE number 1300393 (Why is no real title available?)
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
- New algorithms for maximum weight matching and a decomposition theorem
- Novel algorithms for maximum DS decomposition
- Novel algorithms for maximum DS decomposition
- Combining decomposition approaches for the maximum weight stable set problem
- Solving maximum weighted matching on large graphs with deep reinforcement learning
- Abundant neighborhoods, two-sided markets, and maximal matchings
This page was built for publication: Decomposition algorithms for solving the minimum weight maximal matching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811314)
