The Boolean quadratic programming problem with generalized upper bound constraints

DOI10.1016/j.cor.2016.07.005zbMath1391.90418OpenAlexW2470076424MaRDI QIDQ1652009

Abraham P. Punnen, Yang Wang

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.005

zbMATH Keywords

metaheuristicsquadratic assignmentdiscrete optimizationgeneralized upper boundsBoolean quadratic programsquadratic semi-assignment

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (5)

Solving generalized polynomial problem by using new affine relaxed technique ⋮ Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints ⋮ Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation ⋮ An exact algorithm for the minimum squared load assignment problem ⋮ Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
• A hybrid metaheuristic approach to solving the UBQP problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A study of the quadratic semi-assignment polytope
• A quadratic integer program for the location of interacting hub facilities
• A polynomially solvable class of quadratic semi-assignment problems
• Variable neighborhood search
• Lower bounds for the quadratic semi-assignment problem
• An algorithm for the multiprocessor assignment problem
• Path relinking for unconstrained binary quadratic programming
• Iterated greedy for the maximum diversity problem
• Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
• Algorithm for quadratic semi-assignment problem with partition size coefficients
• Correlation clustering in general weighted graphs
• Convex quadratic and semidefinite programming relaxations in scheduling
• Approximation algorithms for classification problems with pairwise relationships
• Allocating programs containing branches and loops within a multiple processor system
• An Efficient Heuristic Procedure for Partitioning Graphs
• Integer Quadratic Programming Models in Computational Biology
• A quadratic assignment problem without column constraints
• Best reduction of the quadratic semi-assignment problem

This page was built for publication: The Boolean quadratic programming problem with generalized upper bound constraints