Pages that link to "Item:Q895077"
From MaRDI portal
The following pages link to Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel (Q895077):
Displaying 6 items.
- A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
- An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
- Kernel technology to solve discrete optimization problems (Q1699399) (← links)
- Efficient methods to organize the parallel execution of optimization algorithms (Q2281364) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- Algorithm unions for solving discrete optimization problems (Q6066035) (← links)
