A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
From MaRDI portal
Publication:1370656
DOI10.1016/S0305-0548(97)00002-6zbMath0894.90114MaRDI QIDQ1370656
John E. Mitchell, Brian Borchers
Publication date: 26 October 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
90C11: Mixed integer programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
A global optimization problem in portfolio selection, Heuristics for cardinality constrained portfolio optimization, Algorithms and Software for Convex Mixed Integer Nonlinear Programs
Uses Software
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