Pages that link to "Item:Q2664003"
From MaRDI portal
The following pages link to LP-based dual bounds for the maximum quasi-clique problem (Q2664003):
Displaying 4 items.
- Near optimal solutions for maximum quasi-bicliques (Q2377385) (← links)
- Mixed Integer Programming for Searching Maximum Quasi-Bicliques (Q3294898) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)