A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
DOI10.1016/S0305-0548(97)00002-6zbMATH Open0894.90114OpenAlexW1987427249MaRDI QIDQ1370656FDOQ1370656
Authors: 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
Recommendations
- An improved branch and bound algorithm for mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- scientific article; zbMATH DE number 1101647
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11)
Cites Work
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Title not available (Why is that?)
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Nonlinear integer programming algorithms: A survey
- APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
Cited In (6)
- A global optimization problem in portfolio selection
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Heuristics for cardinality constrained portfolio optimization
- Exact optimal experimental designs with constraints
- A Scalable Algorithm for Sparse Portfolio Selection
Uses Software
This page was built for publication: A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370656)