Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
From MaRDI portal
Publication:778626
DOI10.1155/2020/5974820zbMath1442.90127OpenAlexW3018990432MaRDI QIDQ778626
Noah Hunt-Isaak, Richard J. Forrester
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
Related Items
Applications and Computational Advances for Solving the QUBO Model ⋮ Mathematical Programming Models and Exact Algorithms ⋮ Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering ⋮ Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
Cites Work
- Unnamed Item
- The unconstrained binary quadratic programming problem: a survey
- Extending the QCR method to general mixed-integer programs
- The quadratic knapsack problem -- a survey
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- A computational study on the quadratic knapsack problem with multiple constraints
- A simple recipe for concise mixed 0-1 linearizations
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- An improved linearization strategy for zero-one quadratic programming problems
- Exact Solution Methods for the k-Item Quadratic Knapsack Problem
- Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Benchmarking optimization software with performance profiles.
- Different Formulations for Solving the HeaviestK-Subgraph Problem
