An improved branch and bound algorithm for mixed integer nonlinear programs
- 1 April 1994
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 21 (4) , 359-367
- https://doi.org/10.1016/0305-0548(94)90024-8
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Global optimum search for nonconvex NLP and MINLP problemsComputers & Chemical Engineering, 1989
- Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesisIndustrial & Engineering Chemistry Research, 1988
- Branch and Bound Experiments in Convex Nonlinear Integer ProgrammingManagement Science, 1985
- Mixed-integer programming approach for the synthesis of integrated process flowsheetsComputers & Chemical Engineering, 1985
- Network Design and Transportation Planning: Models and AlgorithmsTransportation Science, 1984
- An Approach to the Optimal Positioning of a New ProductManagement Science, 1983
- Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decompositionIEEE Transactions on Automatic Control, 1982
- Quadratic Binary Programming with Application to Capital-Budgeting ProblemsOperations Research, 1970
- An Extension of Lawler and Bell's Method of Discrete Optimization with Examples from Capital BudgetingManagement Science, 1968
- Capital Budgeting of Interrelated Projects: Survey and SynthesisManagement Science, 1966