Pages that link to "Item:Q3057152"
From MaRDI portal
The following pages link to The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search (Q3057152):
Displaying 4 items.
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
- Evolutionary local search for the edge-biconnectivity augmentation problem (Q1603576) (← links)
- A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269) (← links)
