The following pages link to APOGEE (Q20460):
Displaying 37 items.
- Multiple criteria decision analysis. State of the art surveys. In 2 volumes (Q257374) (← links)
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
- On structural decompositions of finite frames (Q295388) (← links)
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints (Q301393) (← links)
- Pooling problems with polynomial-time algorithms (Q306403) (← links)
- A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- On the global solution of multi-parametric mixed integer linear programming problems (Q367172) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem (Q1657401) (← links)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- Global optimization of MIQCPs with dynamic piecewise relaxations (Q1668791) (← links)
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Decomposition strategy for the stochastic pooling problem (Q1928271) (← links)
- A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
- Solving certain complementarity problems in power markets via convex programming (Q2085814) (← links)
- Discretization and global optimization for mixed integer bilinear programming (Q2089882) (← links)
- Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation (Q2129194) (← links)
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems (Q2147914) (← links)
- Sequence of polyhedral relaxations for nonlinear univariate functions (Q2147925) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization (Q2182860) (← links)
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems (Q2250082) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
- A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables (Q2274882) (← links)
- An adaptive discretization algorithm for the design of water usage and treatment networks (Q2331361) (← links)
- Natural gas production network infrastructure development under uncertainty (Q2358131) (← links)
- Piecewise polyhedral formulations for a multilinear term (Q2661606) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design (Q5084598) (← links)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
