Pages that link to "Item:Q1652358"
From MaRDI portal
The following pages link to Clustered maximum weight clique problem: algorithms and empirical analysis (Q1652358):
Displaying 10 items.
- Maximum weight relaxed cliques and Russian doll search revisited (Q1686057) (← links)
- A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem (Q1725600) (← links)
- Maximum dispersion and geometric maximum weight cliques (Q1879248) (← links)
- Collaborative mission optimization for ship rapid search by multiple heterogeneous remote sensing satellites (Q2086950) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)
- A new trust region technique for the maximum weight clique problem (Q2433799) (← links)
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique (Q3627690) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)