The following pages link to (Q5491984):
Displaying 12 items.
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
- Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982) (← links)
- Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
- Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
- Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
- Algorithm unions for solving discrete optimization problems (Q6066035) (← links)
