Valid Inequalities for the Pooling Problem with Binary Variables

DOI10.1007/978-3-642-20807-2_10zbMath1339.90238OpenAlexW21627477MaRDI QIDQ3009755

Claudia D'Ambrosio, Jeff Linderoth, James R. Luedtke

Publication date: 24 June 2011

Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/60722

zbMATH Keywords

poolingglobal optimizationinteger programmingvalid inequalities

Mathematics Subject Classification ID

Integer programming (90C10) Nonconvex programming, global optimization (90C26)

Related Items

Analysis of MILP Techniques for the Pooling Problem, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Complexity analysis and algorithm design of pooling problem, Tightening methods based on nontrivial bounds on bilinear terms, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization, The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints, Variable Bound Tightening and Valid Constraints for Multiperiod Blending, Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms, Strong Convex Nonlinear Relaxations of the Pooling Problem, Relaxations and discretizations for the pooling problem, QPLIB: a library of quadratic programming instances, A branch-and-cut algorithm for mixed-integer bilinear programming, Quadratic optimization with switching variables: the convex hull for \(n=2\), Optimization and sustainable development

Cites Work

• Unnamed Item
• Unnamed Item
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
• Valid Linear Inequalities for Fixed Charge Problems
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Benchmarking optimization software with performance profiles.