Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products
- 22 May 2023
- book chapter
- Published by Springer Nature
- p. 14-28
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictionsDiscrete Applied Mathematics, 2009
- Optimization of block layout design problems with unequal areas: A comparison of MILP and MINLP optimization methodsComputers & Chemical Engineering, 2005
- Reformulation and convex relaxation techniques for global optimization4OR, 2004
- Reduction constraints for the global optimization of NLPsInternational Transactions in Operational Research, 2003
- Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computationsDiscrete Applied Mathematics, 2000
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problemsOperations Research Letters, 1997
- A hierarchy of relaxations and convex hull characterizations for mixed-integer zero—one programming problemsDiscrete Applied Mathematics, 1994
- A new reformulation-linearization technique for bilinear programming problemsJournal of Global Optimization, 1992
- A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization TechniqueJournal of Global Optimization, 1992
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming ProblemsSIAM Journal on Discrete Mathematics, 1990