Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
From MaRDI portal
Publication:5139848
DOI10.1287/ijoc.2018.0871OpenAlexW2963997581WikidataQ127489610 ScholiaQ127489610MaRDI QIDQ5139848
Qinghua Wu, Yang Wang, Fred Glover
Publication date: 11 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2018.0871
Related Items
The Bipartite QUBO, Reinforcement learning based tabu search for the minimum load coloring problem, A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem, The bipartite Boolean quadric polytope, A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment, Responsive strategic oscillation for solving the disjunctively constrained knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- A hybrid metaheuristic approach to solving the UBQP problem
- An effective multilevel tabu search approach for balanced graph partitioning
- A survey of very large-scale neighborhood search techniques
- A note on hashing functions and tabu search algorithms
- Markov chain methods for the bipartite Boolean quadratic programming problem
- Path relinking for unconstrained binary quadratic programming
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Hashing vectors for tabu search
- A path relinking approach with ejection chains for the generalized assignment problem
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Advanced Scatter Search for the Max-Cut Problem
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
- Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
- Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Approximating the Cut-Norm via Grothendieck's Inequality
