An improved branch and bound algorithm for mixed integer nonlinear programs
DOI10.1016/0305-0548(94)90024-8zbMATH Open0797.90069OpenAlexW1987924891MaRDI QIDQ1318452FDOQ1318452
Brian Borchers, John E. Mitchell
Publication date: 27 March 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90024-8
lower boundsbranch and boundLagrangian dualityconvex objective functionszero-one mixed integer nonlinear programs
Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- Branch-and-Bound Methods: A Survey
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Large-Scale Network Topological Optimization
- Methods of Nonlinear 0-1 Programming
- Nonlinear integer programming algorithms: A survey
- An Approach to the Optimal Positioning of a New Product
- APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
Cited In (53)
- A new bounding technique in branch-and-bound algorithms for mixed integer programming
- An algorithm for two-stage stochastic mixed-integer nonlinear convex problems
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- Allocating relations in a distributed database system
- A trust region SQP algorithm for mixed-integer nonlinear programming
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- Optimization methods for mixed integer weakly concave programming problems
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- A penalty-interior-point algorithm for nonlinear constrained optimization
- Direct Gravitational Search Algorithm for Global Optimisation Problems
- A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
- Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
- Asynchronous optimization of part logistics routing problem
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- A heuristic for the label printing problem
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Finding multiple optimal solutions of signomial discrete programming problems with free variables
- The stochastic trim-loss problem
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- Mixed integer programming for a special logic constrained optimal control problem
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Hierarchical maximal-coverage location-allocation: case of generalized search-and-rescue
- Partially distributed outer approximation
- Mixed integer programming with a class of nonlinear convex constraints
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Perspective Reformulation and Applications
- A review of deterministic optimization methods in engineering and management
- Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach
- SICOpt: Solution approach for nonlinear integer stochastic programming problems
- A new method for mean-variance portfolio optimization with cardinality constraints
- Executing join queries in an uncertain distributed environment
- Heuristics for cardinality constrained portfolio optimization
- On linear programming relaxations for solving polynomial programming problems
- A simplex grey wolf optimizer for solving integer programming and minimax problems
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Finding multiple solutions to general integer linear programs
- Tight Upper Bounds on the Cardinality Constrained Mean-Variance Portfolio Optimization Problem Using Truncated Eigendecomposition
- A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
- Exact optimal experimental designs with constraints
- An implicit branch-and-bound algorithm for mixed-integer linear programming
- Extended formulations in mixed integer conic quadratic programming
- An iterative method for solving a bi-objective constrained portfolio optimization problem
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
- Title not available (Why is that?)
Uses Software
Recommendations
- A branch-and-bound algorithm for 0-1 parametric mixed integer programming π π
- Technical NoteβAn Improved Branch-and-Bound Method for Integer Programming π π
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems π π
- A branch and bound algorithm for solving a class of nonlinear integer programming problems π π
- A new bounding technique in branch-and-bound algorithms for mixed integer programming π π
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem π π
- A branch and bound method for the solution of multiparametric mixed integer linear programming problems π π
- An implicit branch-and-bound algorithm for mixed-integer linear programming π π
- A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization π π
This page was built for publication: An improved branch and bound algorithm for mixed integer nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318452)