Pages that link to "Item:Q537985"

The following pages link to Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems (Q537985):

Displaying 14 items.

• \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
• Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
• The bipartite quadratic assignment problem and extensions (Q322542) (← links)
• Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
• A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
• Partial evaluation in rank aggregation problems (Q1652087) (← 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)
• 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)
• A tabu search algorithm with controlled randomization for constructing feasible university course timetables (Q2664347) (← links)
• Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints (Q2668740) (← links)
• Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking (Q5139848) (← links)
• Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation (Q6047870) (← links)