Pages that link to "Item:Q468440"
From MaRDI portal
The following pages link to Polyhedral study of the connected subgraph problem (Q468440):
Displaying 14 items.
- The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut (Q325409) (← links)
- On imposing connectivity constraints in integer programs (Q1683690) (← links)
- On two-connected subgraph polytopes (Q1910503) (← links)
- Optimizing constrained subtrees of trees (Q1914069) (← links)
- Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems (Q2152094) (← links)
- A computational study on the maximum-weight bounded-degree rooted tree problem (Q2246469) (← links)
- Combinatorial properties and further facets of maximum edge subgraph polytopes (Q2840727) (← links)
- Solving Connected Subgraph Problems in Wildlife Conservation (Q3569923) (← links)
- Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems (Q4018843) (← links)
- Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (Q4620424) (← links)
- New facets for the planar subgraph polytope (Q5449667) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5891092) (← links)
- Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)