APOGEE

swMATH8451MaRDI QIDQ20460FDOQ20460

Author name not available (Why is that?)

Cited In (41)

• A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints
• Multiple criteria decision analysis. State of the art surveys. In 2 volumes
• Analysis of MILP Techniques for the Pooling Problem
• Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
• Strong Convex Nonlinear Relaxations of the Pooling Problem
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
• Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
• Global optimization of bilinear programs with a multiparametric disaggregation technique
• On structural decompositions of finite frames
• Piecewise polyhedral formulations for a multilinear term
• Global optimization with spline constraints: a new branch-and-bound method based on B-splines
• A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints
• Pooling problems with polynomial-time algorithms
• A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem
• A MILP formulation for generalized geometric programming using piecewise-linear approximations
• Sequence of polyhedral relaxations for nonlinear univariate functions
• Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization
• Title not available (Why is that?)
• The computational complexity of the pooling problem
• An adaptive discretization algorithm for the design of water usage and treatment networks
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Natural gas production network infrastructure development under uncertainty
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
• Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design
• Global optimization of MIQCPs with dynamic piecewise relaxations
• GLOMIQO: global mixed-integer quadratic optimizer
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
• A review of deterministic optimization methods in engineering and management
• Solving certain complementarity problems in power markets via convex programming
• Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
• Decomposition strategy for the stochastic pooling problem
• Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation
• 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
• On the global solution of multi-parametric mixed integer linear programming problems
• Relaxations and discretizations for the pooling problem
• New multi-commodity flow formulations for the pooling problem
• Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
• Discretization and global optimization for mixed integer bilinear programming
• Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
• An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs

This page was built for software: APOGEE