Pages that link to "Item:Q2253377"

The following pages link to Path relinking for unconstrained binary quadratic programming (Q2253377):

Displaying 23 items.

• \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
• Multi-neighborhood based path relinking for two-sided assembly line balancing problem (Q306088) (← links)
• The bipartite quadratic assignment problem and extensions (Q322542) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
• The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
• Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715) (← links)
• Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange (Q2026705) (← links)
• Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints (Q2108178) (← links)
• Leveraging special-purpose hardware for local search heuristics (Q2125062) (← links)
• Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange (Q2159525) (← links)
• Optimal quadratic reformulations of fourth degree pseudo-Boolean functions (Q2193002) (← 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)
• 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)
• Bi-objective optimization of biclustering with binary data (Q2666768) (← 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)
• Penalty and partitioning techniques to improve performance of QUBO solvers (Q2673235) (← 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)
• Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis (Q6496345) (← links)