Global optimization of a quadratic function subject to a bounded mixed integer consraint set
- 1 December 1990
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 25 (1) , 169-180
- https://doi.org/10.1007/bf02283693
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Jointly constrained bilinear programs and related problems: An overviewComputers & Mathematics with Applications, 1990
- Integer and Combinatorial OptimizationPublished by Wiley ,1988
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimizationJournal of Optimization Theory and Applications, 1986
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming ProblemsManagement Science, 1986
- Improved algorithm for mixed-integer quadratic programs and a computational studyMathematical Programming, 1985
- The perfectly matchable subgraph polytope of a bipartite graphNetworks, 1983
- Jointly Constrained Biconvex ProgrammingMathematics of Operations Research, 1983
- The Indefinite Quadratic Programming ProblemOperations Research, 1979
- Improved Linear Integer Programming Formulations of Nonlinear Integer ProblemsManagement Science, 1975
- Nonconvex Quadratic Programming via Generalized PolarsSIAM Journal on Applied Mathematics, 1975