Pages that link to "Item:Q468440"
From MaRDI portal
The following pages link to Polyhedral study of the connected subgraph problem (Q468440):
Displaying 5 items.
- On imposing connectivity constraints in integer programs (Q1683690) (← links)
- A computational study on the maximum-weight bounded-degree rooted tree problem (Q2246469) (← links)
- Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (Q4620424) (← links)
- Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)
