Pages that link to "Item:Q1123907"
From MaRDI portal
The following pages link to A decomposition strategy for the vertex cover problem (Q1123907):
Displaying 5 items.
- A polynomial time solvable instance of the feasible minimum cover problem (Q293433) (← links)
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- A neural network for the minimum set covering problem (Q1577203) (← links)
- A novel decomposition approach to set covering problems by exploiting special structures (Q2113818) (← links)
- Core influence mechanism on vertex-cover problem through leaf-removal-core breaking (Q3303374) (← links)