Exact Solution Methods for the k-Item Quadratic Knapsack Problem
From MaRDI portal
Publication:2835673
DOI10.1007/978-3-319-45587-7_15zbMath1452.90273arXiv1602.05327OpenAlexW3105658137MaRDI QIDQ2835673
Angelika Wiegele, Lucas Létocart
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.05327
Related Items
Dantzig-Wolfe reformulations for binary quadratic problems, Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
Uses Software
Cites Work
- Extending the QCR method to general mixed-integer programs
- Algorithm for cardinality-constrained quadratic optimization
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Bounds for the quadratic assignment problem using the bundle method
- The quadratic knapsack problem -- a survey
- Linear programming for the \(0-1\) quadratic knapsack problem
- Computational study of a family of mixed-integer quadratic programming problems
- The quadratic 0-1 knapsack problem with series-parallel support
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
- An Algorithm for Large Zero-One Knapsack Problems
- CSDP, A C library for semidefinite programming
- An Interior-Point Method for Semidefinite Programming
- Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method
