Numerical experience with lower bounds for MIQP branch-and-bound

SIAM Journal on Optimization

Volumn 8, Issue 2, 1998, Pages 604-616

  Fletcher, Roger ^a   Leyffer, Sven ^a  

^a UNIVERSITY OF DUNDEE   (United Kingdom)

Author keywords

Branch and bound; Integer programming; Mixed integer quadratic programming

Indexed keywords

EID: 0032222085     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623494268455     Document Type: Article

References (24)

1. E. M. L. BEALE, Integer programming, in The State of the Art in Numerical Analysis, D. A. H. Jacobs, ed., Academic Press, London, 1978.
2. M. BENICHOU, J. M. GAUTHIER, P. GIRODET, G. HENTGES, G. RIBIERE, AND O. VINCENT, Experiments in mixed-integer linear programming, Math. Programming, 1 (1971), pp. 76-94.
3. R. BREU AND C.-A. BURDET, Branch-and-bound experiments in 0-1 programming, Math. Programming Study, 2 (1974), pp. 1-50.
4. R. J. DAKIN, A tree search algorithm for mixed integer programming problems Comput J 8 (1965), pp. 250-255.
5. M. DURAN AND I. E. GROSSMANN, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, Math. Programming, 36 (1986), pp. 307-339.
6. R. FLETCHER, Practical Methods of Optimization, 2nd ed., John Wiley, Chichester, 1987.
7. R. FLETCHER, Resolving degeneracy in quadratic programming, Ann. Oper. Res., 47 (1993), pp. 307-334.
8. R. FLETCHER AND S. LEYFFER, Solving mixed integer nonlinear programs by outer approximation, Math. Programming, 66 (1994), pp. 327-349.
9. O. E. FLIPPO AND A. H. G. RINNOY KAN, A note on Benders decomposition in mixed-integer quadratic programming, Oper. Res. Lett., 9 (1990), pp. 81-83.
10. R. S. GARFINKEL AND G. L. NEMHAUSER, Integer Programming, John Wiley, New York, 1972.
11. A. M. GEOFFRION, Generalized Benders decomposition, J. Optim. Theory Appl 10 (1972) pp. 237-260.
12. D. GOLDFARB AND A. IDNANI, A numerically stable dual method for solving strictly convex quadratic programs, Math. Programming, 27 (1983), pp. 1-33.
13. O. K. GUPTA AND A. RAVINDRAN, Branch and bound experiments in convex nonlinear integer programming, Management Sci., 31 (1985), pp. 1533-1546.
14. W. HOCK AND K. SCHITTKOWSKI, Test Examples for Nonlinear Programming Codes, Springer-Verlag, Berlin, 1981.
15. F. KÖRNER, A new branching rule for the branch-and-bound algorithm for solving nonlinear integer programming problems, BIT, 28 (1988), pp. 701-708.
16. J. W. KWIATOWSKI, Algorithms for Index Tracking, Working paper 90.1, University of Edinburgh, Centre for Financial Markets Research, Edinburgh, UK, 1990.
17. A. H. LAND AND A. G. DOIG, An automatic method for solving discrete programming problems, Econometrica, 28 (1960), pp. 497-520.
18. R. LAZIMY, Improved algorithm for mixed-integer quadratic programs and a computational study, Math. Programming, 32 (1985), pp. 100-113.
19. S. LEYFFER, Deterministic Methods for Mixed Integer Nonlinear Programming, Ph.D. thesis, University of Dundee, Dundee, Scotland, UK, 1993.
20. M. PADBERG AND G. RINALDI, A branch-and-cut algorithm for the resolution of large-scale symmetric travelling salesman problems, SIAM Rev., 33 (1991), pp. 60-100.
21. I. QUESADA AND I. E. GROSSMANN, An LP/NLP based branch-and-bound algorithm for convex MINLP optimization problems, Comput. Chemical Engineering, 16 (1992), pp. 937-947.
22. H. A. TAHA, Integer Programming - Theory, Applications and Computations, Academic Press, London, 1975.
23. O. V. VOLKOVICH, V. R. ROSHCHIN, AND I. V. SERGIENKO, Models and methods of solution of quadratic integer programming problems, Cybernetics, 23 (1987), pp. 289-305.
24. A. C. WILLIAMS, Computational experience with ellipsoid algorithms for linear programming, Math. Programming Soc., COAL Newsletter, 5 (1981), pp. 37-48.