Pages that link to "Item:Q466339"
From MaRDI portal
The following pages link to Solving the maxcut problem by the global equilibrium search (Q466339):
Displaying 12 items.
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- Memetic search for the max-bisection problem (Q339560) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel (Q895077) (← links)
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems (Q1014949) (← links)
- The method of global equilibrium search (Q1968509) (← links)
- Results of an experimental investigation of the efficiency of the global-equilibrium-search method (Q1974338) (← links)
- Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
- Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- An approximate algorithm for the solution of the problem of finding the maximum weighted cut of a graph (Q2897675) (← links)
- The max-out min-in problem: a tool for data analysis (Q6164596) (← links)
