scientific article

zbMath1274.90499MaRDI QIDQ2861492

Pietro Belotti, Mahdi Namazifar, Andrew J. Miller

Publication date: 8 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001034

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

A fair division approach to humanitarian logistics inspired by conditional value-at-risk, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Deriving convex hulls through lifting and projection, Tightening methods based on nontrivial bounds on bilinear terms, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, Error bounds for monomial convexification in polynomial optimization, Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms, The Convex Hull of a Quadratic Constraint over a Polytope, A survey of adjustable robust optimization, Convex hull representations for bounded products of variables, On the Composition of Convex Envelopes for Quadrilinear Terms

Cites Work

• Unnamed Item
• A convex envelope formula for multilinear functions
• Convex envelopes for edge-concave functions
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
• The Convex Envelope of (n–1)-Convex Functions
• Jointly Constrained Biconvex Programming
• On Linear Characterizations of Combinatorial Optimization Problems
• Semidefinite relaxations of fractional programs via novel convexification techniques