Back to Search
Start Over
The boolean quadratic programming problem with generalized upper bound constraints
- Source :
- Computers & Operations Research. 77:1-10
- Publication Year :
- 2017
- Publisher :
- Elsevier BV, 2017.
-
Abstract
- We consider the boolean quadratic programming problem with generalized upper bound constraints (BQP-GUB) which subsumes the well-known quadratic semi-assignment problem. BQP-GUB has applications in engineering, production planning and biology. We present various complexity results on the problem along with different metaheuristic algorithms. Results of extensive experimental analysis are presented demonstrating the efficacy of our proposed algorithms.
- Subjects :
- Quadratically constrained quadratic program
Mathematical optimization
021103 operations research
General Computer Science
Quadratic assignment problem
0211 other engineering and technologies
0102 computer and information sciences
02 engineering and technology
Computer Science::Computational Complexity
Management Science and Operations Research
01 natural sciences
Quadratic residuosity problem
010201 computation theory & mathematics
Modeling and Simulation
Maximum satisfiability problem
Binary quadratic form
Quadratic programming
Generalized assignment problem
Mathematics
Sequential quadratic programming
Subjects
Details
- ISSN :
- 03050548
- Volume :
- 77
- Database :
- OpenAIRE
- Journal :
- Computers & Operations Research
- Accession number :
- edsair.doi...........9dc3be93d614eaf8a1d06d04381dc752