Pages that link to "Item:Q933795"
From MaRDI portal
The following pages link to A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795):
Displaying 12 items.
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
- A new local and global optimization method for mixed integer quadratic programming problems (Q606807) (← links)
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
- Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs (Q2010085) (← links)
- A scalable global optimization algorithm for stochastic nonlinear programs (Q2274886) (← links)
- Lagrangian relaxation of the generic materials and operations planning model (Q2303321) (← links)
- Natural gas production network infrastructure development under uncertainty (Q2358131) (← links)
- Unit-operation nonlinear modeling for planning and scheduling applications (Q2358139) (← links)
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
