Pages that link to "Item:Q1758060"
From MaRDI portal
The following pages link to Integer programming formulations for the minimum weighted maximal matching problem (Q1758060):
Displaying 10 items.
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- Minimum cost \(b\)-matching problems with neighborhoods (Q2082547) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Domination versus edge domination (Q2197443) (← links)
- Bounding and approximating minimum maximal matchings in regular graphs (Q2222947) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Maximal matching polytope in trees (Q2815540) (← links)
- An Integer Programming Formulation for the Maximum k-Subset Intersection Problem (Q3195319) (← links)
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem (Q5131709) (← links)
- Facility location problems on graphs with non-convex neighborhoods (Q6047916) (← links)