The Boolean quadratic programming problem with generalized upper bound constraints
type: Item
instance of: scholarly article
title: The Boolean quadratic programming problem with generalized upper bound constraints
zbMATH Open document ID: 1391.90418
author: Yang Wang
author: Abraham P. Punnen
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901257
zbMATH Keywords: discrete optimization
zbMATH Keywords: Boolean quadratic programs
zbMATH Keywords: quadratic assignment
zbMATH Keywords: quadratic semi-assignment
zbMATH Keywords: generalized upper bounds
zbMATH Keywords: metaheuristics
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2016.07.005
OpenAlex ID: W2470076424
cites work: Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
cites work: A polynomially solvable class of quadratic semi-assignment problems
cites work: Best reduction of the quadratic semi-assignment problem
cites work: Lower bounds for the quadratic semi-assignment problem
cites work: A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
cites work: Correlation clustering in general weighted graphs
cites work: Algorithm for quadratic semi-assignment problem with partition size coefficients
cites work: Q4354785
cites work: A quadratic assignment problem without column constraints
cites work: Integer Quadratic Programming Models in Computational Biology
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Approximation algorithms for classification problems with pairwise relationships
cites work: Iterated greedy for the maximum diversity problem
cites work: A hybrid metaheuristic approach to solving the UBQP problem
cites work: An algorithm for the multiprocessor assignment problem
cites work: Variable neighborhood search
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: Q4452897
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: A study of the quadratic semi-assignment polytope
cites work: Convex quadratic and semidefinite programming relaxations in scheduling
cites work: Allocating programs containing branches and loops within a multiple processor system
cites work: Path relinking for unconstrained binary quadratic programming
DOI: 10.1016/J.COR.2016.07.005
Recommended article: A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm1
Recommended article: Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints
Recommended article: On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
Recommended article: Dual quadratic estimates in polynomial and Boolean programming
Recommended article: Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
Recommended article: Functionally redundant constraints for Boolean quadratic-type optimization problems
Recommended article: The spherical constraint in Boolean quadratic programs
Recommended article: Q4352298
Recommended article: Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints
Recommended article: An efficient method for obtaining sharp bounds for nonlinear boolean programming problems
description: scientific article; zbMATH DE number 6901257