Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
From MaRDI portal
Publication:778626
DOI10.1155/2020/5974820zbMATH Open1442.90127OpenAlexW3018990432MaRDI QIDQ778626FDOQ778626
Authors: Richard John Forrester, Noah Hunt-Isaak 
Publication date: 3 July 2020
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/5974820
Recommendations
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Linear Reformulations of Integer Quadratic Programs
- Quadratic binary programming models in computational biology
- Structured linear reformulation of binary quadratically constrained quadratic programs
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
Cites Work
- The quadratic knapsack problem -- a survey
- Benchmarking optimization software with performance profiles.
- 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
- The unconstrained binary quadratic programming problem: a survey
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Extending the QCR method to general mixed-integer programs
- A computational study on the quadratic knapsack problem with multiple constraints
- An improved linearization strategy for zero-one quadratic programming problems
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Different Formulations for Solving the HeaviestK-Subgraph Problem
- Quadratic binary programming models in computational biology
- A simple recipe for concise mixed 0-1 linearizations
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- Exact solution methods for the \(k\)-item quadratic knapsack problem
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
Cited In (10)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- Mathematical programming models and exact algorithms
- Applications and computational advances for solving the QUBO model
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Quadratic binary programming models in computational biology
- An improved linearization technique for a class of quadratic 0-1 programming problems
- Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems
This page was built for publication: Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778626)
