Path relinking for unconstrained binary quadratic programming
From MaRDI portal
Publication:2253377
DOI10.1016/j.ejor.2012.07.012zbMath1292.90225OpenAlexW2158984240MaRDI QIDQ2253377
Yang Wang, Jin-Kao Hao, Fred Glover, Zhipeng Lü
Publication date: 27 July 2014
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.07.012
Related Items
\(f\)-flip strategies for unconstrained binary quadratic programming, Leveraging special-purpose hardware for local search heuristics, Metaheuristic Algorithms, The Bipartite QUBO, Building an iterative heuristic solver for a quantum annealer, Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs, Multi-neighborhood based path relinking for two-sided assembly line balancing problem, The bipartite quadratic assignment problem and extensions, The Boolean quadratic programming problem with generalized upper bound constraints, Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange, Bi-objective optimization of biclustering with binary data, Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints, Capping methods for the automatic configuration of optimization algorithms, Penalty and partitioning techniques to improve performance of QUBO solvers, Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation, The unconstrained binary quadratic programming problem: a survey, Optimal Seating Assignment in the COVID-19 Era via Quantum Computing, Optimal quadratic reformulations of fourth degree pseudo-Boolean functions, Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking, Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms, Effective metaheuristic algorithms for the minimum differential dispersion problem, Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem, Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints, The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the maxcut problem by the global equilibrium search
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- Diversification-driven tabu search for unconstrained binary quadratic problems
- A hybrid metaheuristic approach to solving the UBQP problem
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- GRASP for set packing problems.
- An evolutionary heuristic for quadratic 0-1 programming
- A unified modeling and solution framework for combinatorial optimization problems
- Obtaining test problems via Internet
- A new approach for modeling and solving set packing problems
- TTT plots: a perl program to create time-to-target plots
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- On the notion of balance of a signed graph
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- Advanced Scatter Search for the Max-Cut Problem
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Randomized heuristics for the Max-Cut problem
- Scatter Search and Path Relinking: Advances and Applications
- A Decomposition Method for Quadratic Zero-One Programming
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
