An improved branch and bound algorithm for mixed integer nonlinear programs
From MaRDI portal
Publication:1318452
DOI10.1016/0305-0548(94)90024-8zbMath0797.90069OpenAlexW1987924891MaRDI QIDQ1318452
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
branch and boundlower boundsLagrangian dualityconvex objective functionszero-one mixed integer nonlinear programs
Convex programming (90C25) Mixed integer programming (90C11) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Exact optimal experimental designs with constraints, Asynchronous optimization of part logistics routing problem, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Perspective Reformulation and Applications, Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization, Perspective reformulations of mixed integer nonlinear programs with indicator variables, Finding multiple solutions to general integer linear programs, Executing join queries in an uncertain distributed environment, Allocating relations in a distributed database system, On linear programming relaxations for solving polynomial programming problems, A penalty-interior-point algorithm for nonlinear constrained optimization, A new method for mean-variance portfolio optimization with cardinality constraints, A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs, A simplex grey wolf optimizer for solving integer programming and minimax problems, A heuristic for the label printing problem, An overview of MINLP algorithms and their implementation in Muriqui optimizer, Two linear approximation algorithms for convex mixed integer nonlinear programming, An iterative method for solving a bi-objective constrained portfolio optimization problem, Extended formulations in mixed integer conic quadratic programming, Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables, Lift-and-project cuts for convex mixed integer nonlinear programs, A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization, A hierarchy of relaxations for nonlinear convex generalized disjunctive programming, Direct Gravitational Search Algorithm for Global Optimisation Problems, A review of deterministic optimization methods in engineering and management, Finding multiple optimal solutions of signomial discrete programming problems with free variables, Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming, Optimization methods for mixed integer weakly concave programming problems, Hierarchical maximal-coverage location-allocation: case of generalized search-and-rescue, A trust region SQP algorithm for mixed-integer nonlinear programming, Mixed integer programming with a class of nonlinear convex constraints, Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation, A dynamic convexized method for nonconvex mixed integer nonlinear programming, Mixed integer programming for a special logic constrained optimal control problem, Solving convex MINLP optimization problems using a sequential cutting plane algorithm, Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra, Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach, Tight Upper Bounds on the Cardinality Constrained Mean-Variance Portfolio Optimization Problem Using Truncated Eigendecomposition, Partially distributed outer approximation, The stochastic trim-loss problem, Global optimization of signomial mixed-integer nonlinear programming problems with free variables, SICOpt: Solution approach for nonlinear integer stochastic programming problems, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, Heuristics for cardinality constrained portfolio optimization, An algorithm for two-stage stochastic mixed-integer nonlinear convex problems, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear integer programming algorithms: A survey
- APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
- An Approach to the Optimal Positioning of a New Product
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Methods of Nonlinear 0-1 Programming
- Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
- Large-Scale Network Topological Optimization
- Branch-and-Bound Methods: A Survey
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
