A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs

DOI10.1016/S0305-0548(97)00002-6zbMath0894.90114OpenAlexW1987427249MaRDI QIDQ1370656

Brian Borchers, John E. Mitchell

Publication date: 26 October 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00002-6

zbMATH Keywords

branch-and-boundtest problemsconvex 0-1 mixed integer nonlinear programs

Mathematics Subject Classification ID

Mixed integer programming (90C11) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

Exact optimal experimental designs with constraints ⋮ Algorithms and Software for Convex Mixed Integer Nonlinear Programs ⋮ A global optimization problem in portfolio selection ⋮ A Scalable Algorithm for Sparse Portfolio Selection ⋮ Heuristics for cardinality constrained portfolio optimization

Uses Software

• DICOPT
• GAMS

Cites Work

• Unnamed Item
• Nonlinear integer programming algorithms: A survey
• An improved branch and bound algorithm for mixed integer nonlinear programs
• APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Quadratic Binary Programming with Application to Capital-Budgeting Problems

This page was built for publication: A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs