The following pages link to (Q5687254):
Displaying 7 items.
- Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling (Q669802) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Indirect unstructured hex-dominant mesh generation using tetrahedra recombination (Q722824) (← links)
- Algorithms for the fixed point property (Q1285782) (← links)
- A study of ACO capabilities for solving the maximum clique problem (Q2491340) (← links)
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469) (← links)
- Fast heuristics for large scale covering-location problems (Q5959388) (← links)
