Pages that link to "Item:Q336712"

The following pages link to Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712):

Displaying 15 items.

• \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
• Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
• Memetic search for the max-bisection problem (Q339560) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
• A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
• An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
• The generalized independent set problem: polyhedral analysis and solution approaches (Q1753398) (← links)
• The directed profitable rural postman problem with incompatibility constraints (Q1753601) (← links)
• Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
• Metaheuristic Algorithms (Q5050149) (← links)
• Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation (Q6047870) (← links)
• Adaptive randomization in network data (Q6200871) (← links)