A hybrid metaheuristic approach to solving the UBQP problem
From MaRDI portal
Publication:613436
DOI10.1016/j.ejor.2010.06.039zbMath1206.90113OpenAlexW2099120658MaRDI QIDQ613436
Jin-Kao Hao, Zhipeng Lü, Fred Glover
Publication date: 20 December 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.06.039
Integer programming (90C10) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Heuristic search to the capacitated clustering problem, Metaheuristic Algorithms, The Bipartite QUBO, Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs, A sample average approximation approach to the berth allocation problem with uncertain tides, The bipartite quadratic assignment problem and extensions, Probabilistic GRASP-tabu search algorithms for the UBQP problem, Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints, A memetic algorithm to pack unequal circles into a square, The Boolean quadratic programming problem with generalized upper bound constraints, A quality and distance guided hybrid algorithm for the vertex separator problem, Memetic search for the max-bisection problem, \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance, A two-phase tabu search based evolutionary algorithm for the maximum diversity problem, The unconstrained binary quadratic programming problem: a survey, Stochastic local search and parameters recommendation: a case study on flowshop problems, Solving unconstrained binary quadratic programming problem by global equilibrium search, Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking, Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, Path relinking for unconstrained binary quadratic programming, Modelling transfer line design problem via a set partitioning problem, 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, A hybrid metaheuristic method for the maximum diversity problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- A note on xQx as a modelling and solution framework for the linear ordering problem
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- A memetic algorithm for graph coloring
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- An evolutionary heuristic for quadratic 0-1 programming
- Greedy and local search heuristics for unconstrained binary quadratic programming
- A unified modeling and solution framework for combinatorial optimization problems
- Obtaining test problems via Internet
- A new modeling and solution approach for the set-partitioning problem
- A new approach for modeling and solving set packing problems
- 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
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Quadratic knapsack problems
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- A Decomposition Method for Quadratic Zero-One Programming
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- Introduction to global optimization.
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
