Inductive linearization for binary quadratic programs with linear constraints: a computational study
From MaRDI portal
Publication:6489313
DOI10.1007/S10288-023-00537-5MaRDI QIDQ6489313
Publication date: 21 April 2024
Published in: 4OR (Search for Journal in Brave)
General topics of discrete mathematics in relation to computer science (68R01) Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Quadratic programming (90C20) Linear programming (90C05) Boolean programming (90C09)
Cites Work
- Unnamed Item
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- On the quadratic assignment problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- QAPLIB - a quadratic assignment problem library
- A semidefinite programming approach to the quadratic knapsack problem
- Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays
- Compact linearization for binary quadratic problems subject to assignment constraints
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- The quadratic shortest path problem: complexity, approximability, and solution methods
- A natural quadratic approach to the generalized graph layering problem
- QPLIB: a library of quadratic programming instances
- Compact linearization for binary quadratic problems
- A Memetic Heuristic for the Generalized Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Best reduction of the quadratic semi-assignment problem
- Inductive linearization for binary quadratic programs with linear constraints
This page was built for publication: Inductive linearization for binary quadratic programs with linear constraints: a computational study