A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
From MaRDI portal
(Redirected from Publication:933795)
Recommendations
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- A polyhedral branch-and-cut approach to global optimization
Cites work
- A branch and bound method for stochastic global optimization
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A global optimization algorithm for linear fractional and bilinear programs
- A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
- A Lagrangian based branch-and-bound algorithm for production-transportation problems
- A new reformulation-linearization technique for bilinear programming problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- BARON: A general purpose global optimization software package
- Canonical Cuts on the Unit Hypercube
- Complete search in continuous global optimization and constraint satisfaction
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Dual decomposition in stochastic integer programming
- Global minimum potential energy conformations of small molecules
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- scientific article; zbMATH DE number 2068051 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Introduction to Stochastic Programming
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving mixed integer nonlinear programs by outer approximation
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
Cited in
(19)- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
- The p-Lagrangian relaxation for separable nonconvex MIQCQP problems
- A scalable global optimization algorithm for stochastic nonlinear programs
- Lagrangian relaxation of the generic materials and operations planning model
- Natural gas production network infrastructure development under uncertainty
- Unit-operation nonlinear modeling for planning and scheduling applications
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
- A new local and global optimization method for mixed integer quadratic programming problems
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- Polylithic modeling and solution approaches using algebraic modeling systems
- MUSE-BB: a decomposition algorithm for nonconvex two-stage problems using strong multisection branching
- On the convergence order of value function relaxations used in decomposition-based global optimization of nonconvex stochastic programs
- A review of recent advances in global optimization
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
This page was built for publication: A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q933795)
