Pages that link to "Item:Q2274851"
From MaRDI portal
The following pages link to An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851):
Displaying 20 items.
- Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP (Q2129200) (← links)
- Sequence of polyhedral relaxations for nonlinear univariate functions (Q2147925) (← links)
- The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
- Piecewise polyhedral formulations for a multilinear term (Q2661606) (← links)
- Improved convex and concave relaxations of composite bilinear forms (Q2697000) (← links)
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization (Q3296380) (← links)
- Technical Note—On Nested Partitions Method for Global Optimization (Q5031642) (← links)
- Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design (Q5084598) (← links)
- (Q5187094) (← links)
- Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management (Q6053589) (← links)
- A stochastic biomass blending problem in decentralized supply chains (Q6076480) (← links)
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs (Q6166099) (← links)
- Real-time dispatch optimization for concentrating solar power with thermal energy storage (Q6173776) (← links)
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms (Q6181371) (← links)
- A tight compact quadratically constrained convex relaxation of the optimal power flow problem (Q6568415) (← links)
- MIP relaxations in factorable programming (Q6601201) (← links)
- Piecewise polyhedral relaxations of multilinear optimization (Q6622747) (← links)
