Verification of Hybrid Systems via Mathematical Programming
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Orthogonal drawings of graphs with vertex and edge labels
Computational Geometry: Theory and Applications
A heuristic for the label printing problem
Computers and Operations Research
A support vector machine with integer parameters
Neurocomputing
Branching and bounds tighteningtechniques for non-convex MINLP
Optimization Methods & Software - GLOBAL OPTIMIZATION
Orthogonal drawings of graphs with vertex and edge labels
Computational Geometry: Theory and Applications
Steady-state and N-stages control for isolated controlled intersections
ACC'09 Proceedings of the 2009 conference on American Control Conference
Brief paper: Convex relaxations for mixed integer predictive control
Automatica (Journal of IFAC)
Experiments with a feasibility pump approach for nonconvex MINLPs
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
On the equivalence of linear complementarity problems
Operations Research Letters
| Hi-index | 0.00 |
The solution of convex mixed-integer quadratic programming (MIQP) problems with a general branch-and-bound framework is considered. It is shown how lower bounds can be computed efficiently during the branch-and-bound process. Improved lower bounds such as the ones derived in this paper can reduce the number of quadratic programming (QP) problems that have to be solved. The branch-and-bound approach is also shown to be superior to other approaches in solving MIQP problems. Numerical experience is presented which supports these conclusions.