Pages that link to "Item:Q1653365"
From MaRDI portal
The following pages link to A biased random-key genetic algorithm for the maximum quasi-clique problem (Q1653365):
Displaying 10 items.
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems (Q1273655) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains (Q6066639) (← links)
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem (Q6069764) (← links)
- Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches (Q6070501) (← links)
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)
- On finding the community with maximum persistence probability (Q6655141) (← links)
