Valid Inequalities for the Pooling Problem with Binary Variables
From MaRDI portal
Recommendations
- A bilinear approach to the pooling problem†
- Strong formulations for the pooling problem
- Relaxations and discretizations for the pooling problem
- Boole-Bonferroni Inequalities and Linear Programming
- Strong convex nonlinear relaxations of the pooling problem
- Valid inequalities for mixed 0-1 programs
- A polynomially solvable case of the pooling problem
- Pooling problems with polynomial-time algorithms
- The computational complexity of the pooling problem
- A new Lagrangean approach to the pooling problem
Cites work
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
- Benchmarking optimization software with performance profiles.
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- Valid Linear Inequalities for Fixed Charge Problems
Cited in
(16)- Complexity analysis and algorithm design of pooling problem
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
- Quadratic optimization with switching variables: the convex hull for \(n=2\)
- Tightening methods based on nontrivial bounds on bilinear terms
- Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization
- QPLIB: a library of quadratic programming instances
- A branch-and-cut algorithm for mixed-integer bilinear programming
- Optimization and sustainable development
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Analysis of MILP techniques for the pooling problem
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending
- Strong convex nonlinear relaxations of the pooling problem
- Relaxations and discretizations for the pooling problem
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms
- A sufficient condition for pooling data
This page was built for publication: Valid Inequalities for the Pooling Problem with Binary Variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3009755)
