Pages that link to "Item:Q4972544"
From MaRDI portal
The following pages link to Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes (Q4972544):
Displaying 13 items.
- Data-driven stochastic optimization for distributional ambiguity with integrated confidence region (Q2079685) (← links)
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\) (Q2093276) (← links)
- Non-convex nested Benders decomposition (Q2097672) (← links)
- On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement (Q2115319) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities (Q2136869) (← links)
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (Q2173514) (← links)
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities (Q2330657) (← links)
- Maximizing the storage capacity of gas networks: a global MINLP approach (Q2331362) (← links)
- Data-driven mixed-integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems (Q2673583) (← links)
- On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations (Q2694515) (← links)
- A linear programming approach to difference-of-convex piecewise linear approximation (Q6090153) (← links)
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs (Q6166099) (← links)