An improved branch and bound algorithm for mixed integer nonlinear programs

@article{Borchers1994AnIB,
  title={An improved branch and bound algorithm for mixed integer nonlinear programs},
  author={Brian Borchers and John E. Mitchell},
  journal={Computers & OR},
  year={1994},
  volume={21},
  pages={359-367}
}
This paper describes an improved branch and bound code for zero-one mixed integer nonlinear programs with convex objective functions and constraints. The code uses Lagrangian duality to obtain lower bounds. The code also uses early branching to avoid solving some subproblems to optimality. Computational results show substantial performance improvements on many problems. 
BETA
Highly Cited
This paper has 182 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
SHOWING 1-10 OF 60 CITATIONS, ESTIMATED 33% COVERAGE

183 Citations

01020'95'00'06'12'18
Citations per Year
Semantic Scholar estimates that this publication has 183 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

Dimitri Bertsekas and Robert Gallager, Data Networks

  • Newspaper Enterprise Association Inc., The World Almanac, Book qf Facts. Scripps Howard
  • Prentice-Hall, Englewood Cliffs, N.J. (). Robert…
  • 1990

Kocis and Ignacio E . Grossmann , Global optimization of nonconvex mixed - integer nonlinear programming ( MINLP ) problems in process synthesis

  • D. Horsky Gavish, K. Srikanth
  • Ind . Engw Ciwm . Res .
  • 1988

Gupta and A . Ravindran , Nonlinear integer programming algorithms : a survey

  • E. J. Johnson P. L. Hammer
  • OPSEARCH
  • 1983

Capital budgeting of interrelated projects

  • H. M. Weingartner
  • Mgmt Sci
  • 1966

Similar Papers

Loading similar papers…