Pages that link to "Item:Q6088204"
From MaRDI portal
The following pages link to An exact algorithm for the maximum quasi‐clique problem (Q6088204):
Displaying 10 items.
- Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- Near optimal solutions for maximum quasi-bicliques (Q2377385) (← links)
- Mixed Integer Programming for Searching Maximum Quasi-Bicliques (Q3294898) (← links)
- An Exact Algorithm for the Minimum Dominating Clique Problem (Q3499731) (← links)
- <i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches (Q6070501) (← links)
- Exact algorithms for the product configuration problem (Q6080625) (← links)
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)