Pages that link to "Item:Q613436"

The following pages link to A hybrid metaheuristic approach to solving the UBQP problem (Q613436):

Displaying 22 items.

• The bipartite quadratic assignment problem and extensions (Q322542) (← links)
• Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
• Memetic search for the max-bisection problem (Q339560) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982) (← links)
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
• A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
• Heuristic search to the capacitated clustering problem (Q1622798) (← links)
• A memetic algorithm to pack unequal circles into a square (Q1651582) (← links)
• The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
• A quality and distance guided hybrid algorithm for the vertex separator problem (Q1652081) (← links)
• Modelling transfer line design problem via a set partitioning problem (Q1758032) (← links)
• Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints (Q2108178) (← links)
• \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance (Q2163799) (← links)
• Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
• Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
• The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
• Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs (Q2629716) (← links)
• A two-phase tabu search based evolutionary algorithm for the maximum diversity problem (Q2673240) (← links)
• Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking (Q5139848) (← links)
• Stochastic local search and parameters recommendation: a case study on flowshop problems (Q6079864) (← links)