Tightening concise linear reformulations of 0-1 cubic programs

DOI10.1080/02331934.2015.1091821zbMath1338.90390OpenAlexW2278643616MaRDI QIDQ2810099

Richard J. Forrester

Publication date: 31 May 2016

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2015.1091821

zbMATH Keywords

linearizationreformulation-linearization technique (RLT)0-1 cubic program

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30)

Related Items (1)

Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering

Cites Work

• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• An extended formulation approach to the edge-weighted maximal clique problem
• Min-cut clustering
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• A simple recipe for concise mixed 0-1 linearizations
• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Quadratic knapsack problems
• An Integer Programming Algorithm for Portfolio Selection
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
• Capital Expenditure Programming and Some Alternative Approaches to Risk

This page was built for publication: Tightening concise linear reformulations of 0-1 cubic programs