Tightening concise linear reformulations of 0-1 cubic programs

DOI10.1080/02331934.2015.1091821MaRDI QIDQ2810099zbMATH OpenOpenAlexFDO

Authors Richard John 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

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

Recommendations

• Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering
• Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
• Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
• Efficient reformulation for 0-1 programs -- methods and computational results
• A simple recipe for concise mixed 0-1 linearizations

Cites work

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

Cited in

(2)

• Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
• Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810099)