Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
Open Access
- 1 May 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 8 (2), 604-616
- https://doi.org/10.1137/s1052623494268455
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Solving mixed integer nonlinear programs by outer approximationMathematical Programming, 1994
- Resolving degeneracy in quadratic programmingAnnals of Operations Research, 1993
- A note on benders decomposition in mixed-integer quadratic programmingOperations Research Letters, 1990
- An outer-approximation algorithm for a class of mixed-integer nonlinear programsMathematical Programming, 1986
- Branch and Bound Experiments in Convex Nonlinear Integer ProgrammingManagement Science, 1985
- A numerically stable dual method for solving strictly convex quadratic programsMathematical Programming, 1983
- Branch and bound experiments in zero-one programmingPublished by Springer Nature ,1974
- Generalized Benders decompositionJournal of Optimization Theory and Applications, 1972
- Experiments in mixed-integer linear programmingMathematical Programming, 1971
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965