Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
From MaRDI portal
Publication:2629716
DOI10.1016/j.ejor.2014.09.036zbMath1339.90233arXiv1305.5610OpenAlexW2014883819MaRDI QIDQ2629716
Abraham P. Punnen, Gary A. Kochenberger, Fred Glover, Tao Ye
Publication date: 6 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.5610
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90) Boolean programming (90C09)
Related Items
Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables, The Bipartite QUBO, Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container, The bipartite quadratic assignment problem and extensions, Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem, Partial evaluation in rank aggregation problems, The bipartite Boolean quadric polytope, A decision method on yard cranes transformation and deployment in green ports, 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, Markov chain methods for the bipartite Boolean quadratic programming problem, Combinatorial optimization with interaction costs: complexity and solvable cases, An efficient local search framework for the minimum weighted vertex cover problem, Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms, Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems, The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
Cites Work
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming 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
- Diversification-driven tabu search for unconstrained binary quadratic problems
- A hybrid metaheuristic approach to solving the UBQP problem
- A survey of very large-scale neighborhood search techniques
- Path relinking for unconstrained binary quadratic programming
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
- Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications
- Approximating the Cut-Norm via Grothendieck's Inequality
