The Boolean quadric polytope: some characteristics, facets and relatives
Mathematical Programming: Series A and B
Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
Annals of Operations Research
Capacitated facility location: separation algorithms and computational experience
Mathematical Programming: Series A and B - Special issue on computational integer programming
Dual Bounds and Optimality Cuts for All-Quadratic Programs with Convex Constraints
Journal of Global Optimization
Nonconvex Quadratic Programs, Linear Complementarity Problems, and Integer Linear Programs
5th Conference on Optimization Techniques, Part 1
Facets of the Complementarity Knapsack Polytope
Mathematics of Operations Research
Seizure warning algorithm based on optimization and nonlinear dynamics
Mathematical Programming: Series A and B
A polyhedral study of nonconvex quadratic programs with box constraints
Mathematical Programming: Series A and B
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
Mathematical Programming: Series A and B
Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming
Computational Optimization and Applications
Flow pack facets of the single node fixed-charge flow polytope
Operations Research Letters
Flow pack facets of the single node fixed-charge flow polytope
Operations Research Letters
| Hi-index | 0.00 |
Recent work has demonstrated the potential for globally optimizing nonconvex quadratic programs using a reformulation based on the first order optimality conditions. We show how this reformulation may be generalized to account for fixed cost variables. We then extend some of the polyhedral work that has been done for bound constrained QPs to handle such fixed cost variables. We show how to lift known classes of inequalities for the case without fixed cost variables and propose several new classes. These inequalities are incorporated in a branch-and-cut algorithm.