Pages that link to "Item:Q607875"

The following pages link to Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875):

Displaying 15 items.

• Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
• An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
• A matheuristic for the generalized order acceptance and scheduling problem (Q2077965) (← links)
• Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
• Quadratic bottleneck knapsack problems (Q2359152) (← links)
• On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
• Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs (Q2629716) (← links)
• Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints (Q2668740) (← links)
• Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
• Optimality Conditions for the Minimization of Quadratic 0-1 Problems (Q2945127) (← links)
• A knowledge-based iterated local search for the weighted total domination problem (Q6500414) (← links)