Tightening concise linear reformulations of 0-1 cubic programs
From MaRDI portal
Publication:2810099
DOI10.1080/02331934.2015.1091821zbMATH Open1338.90390OpenAlexW2278643616MaRDI QIDQ2810099FDOQ2810099
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
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
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Quadratic knapsack problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Quadratic Binary Programming with Application to Capital-Budgeting 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
- Min-cut clustering
- An Integer Programming Algorithm for Portfolio Selection
- An extended formulation approach to the edge-weighted maximal clique problem
- A simple recipe for concise mixed 0-1 linearizations
- Capital Expenditure Programming and Some Alternative Approaches to Risk
Cited In (2)
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)
