Pages that link to "Item:Q689140"
From MaRDI portal
The following pages link to Decomposition in general mathematical programming (Q689140):
Displaying 11 items.
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm (Q746812) (← links)
- Decomposition-based inner- and outer-refinement algorithms for global optimization (Q1756777) (← links)
- Inexact solution of NLP subproblems in MINLP (Q1942026) (← links)
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (Q2173514) (← links)
- Problems related to estimating the coefficients of exact penalty functions (Q2320225) (← links)
- Petroleum supply planning: reformulations and a novel decomposition algorithm (Q2358145) (← links)
- A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
- Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint (Q2947228) (← links)
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization (Q3296380) (← links)
- The Benders Dual Decomposition Method (Q5130513) (← links)
- Outer approximation for pseudo-convex mixed-integer nonlinear program problems (Q6494309) (← links)