Pages that link to "Item:Q2492699"
From MaRDI portal
The following pages link to A polyhedral study of the generalized vertex packing problem (Q2492699):
Displaying 6 items.
- A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
- A class of web-based facets for the generalized vertex packing problem (Q1763480) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)
