A computational study on the quadratic knapsack problem with multiple constraints
From MaRDI portal
Recommendations
- Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
- A cut-and-branch algorithm for the quadratic knapsack problem
- A note on optimal solutions to quadratic knapsack problems
- Integer quadratic knapsack problems
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
Cites work
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- scientific article; zbMATH DE number 1795719 (Why is no real title available?)
- scientific article; zbMATH DE number 3335677 (Why is no real title available?)
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A unified modeling and solution framework for combinatorial optimization problems
- An Improved MIP Formulation for Products of Discrete and Continuous Variables
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Exact Solution of the Quadratic Knapsack Problem
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Linear forms of nonlinear expressions: new insights on old ideas
- Linear programming for the \(0-1\) quadratic knapsack problem
- Quadratic knapsack problems
- Solution of large quadratic knapsack problems through aggressive reduction
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The quadratic knapsack problem -- a survey
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(17)- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- The bipartite Boolean quadric polytope
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- Planning personnel retraining: column generation heuristics
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
- An ejection chain approach for the quadratic multiple knapsack problem
- Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
- Generalized quadratic multiple knapsack problem and two solution approaches
- A cut-and-branch algorithm for the quadratic knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A computational study on QP problems with general linear constraints
- Iterated responsive threshold search for the quadratic multiple knapsack problem
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
This page was built for publication: A computational study on the quadratic knapsack problem with multiple constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761936)
