Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem

DOI10.1002/nav.20364zbMath1184.90137WikidataQ60395659 ScholiaQ60395659MaRDI QIDQ3406118

Warren P. Adams, Richard J. Forrester, Paul T. Hadavas

Publication date: 12 February 2010

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20364

zbMATH Keywords

linearization; 0-1 quadratic knapsack problem

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Related Items

Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners

Cites Work

• Unnamed Item
• Mixed-integer bilinear programming problems
• A new linearization technique for multi-quadratic 0-1 programming problems.
• A conditional logic approach for strengthening mixed 0-1 linear programs
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• The quadratic knapsack problem -- a survey
• An extended formulation approach to the edge-weighted maximal clique problem
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• An efficient linearization approach for mixed-integer problems
• A linearization method for mixed 0--1 polynomial programs
• A simple recipe for concise mixed 0-1 linearizations
• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
• Linear forms of nonlinear expressions: new insights on old ideas
• Constrained 0-1 quadratic programming: basic approaches and extensions
• Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
• Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Quadratic knapsack problems
• A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
• Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions
• Exact Solution of the Quadratic Knapsack Problem
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Quadratic Binary Programming with Application to Capital-Budgeting Problems