Pages that link to "Item:Q4083700"
From MaRDI portal
The following pages link to An efficient algorithm for minimumk-covers in weighted graphs (Q4083700):
Displaying 7 items.
- Edge covering problem under hybrid uncertain environments (Q371513) (← links)
- Fuzzy minimum weight edge covering problem (Q1031614) (← links)
- Forest covers and a polyhedral intersection theorem (Q1121807) (← links)
- Lot-sizing polyhedra with a cardinality constraint (Q1198618) (← links)
- Cluster generation and grouping using mathematical programming (Q1255741) (← links)
- Constrained weighted matchings and edge coverings in graphs (Q1304484) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
