Lagrangian heuristics for the quadratic knapsack problem
From MaRDI portal
Publication:5963311
DOI10.1007/s10589-015-9763-3zbMath1342.90159OpenAlexW433132519MaRDI QIDQ5963311
Abilio Lucena, Jesus Ossian Cunha, Luidi Simonetti
Publication date: 7 March 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9763-3
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A lifted-space dynamic programming algorithm for the quadratic knapsack problem ⋮ Parametric convex quadratic relaxation of the quadratic knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Non delayed relax-and-cut algorithms
- The quadratic knapsack problem -- a survey
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Linear programming for the \(0-1\) quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Min-cut clustering
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- A semidefinite programming approach to the quadratic knapsack problem
- A new upper bound for the 0-1 quadratic knapsack problem
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- A relax-and-cut algorithm for the set partitioning problem
- A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem
- A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- Matheuristics
- Quadratic knapsack problems
- Exact Solution of the Quadratic Knapsack Problem
- Quadratic knapsack relaxations using cutting planes and semidefinite programming
- Validation of subgradient optimization
- 0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization
- Discrete-Variable Extremum Problems
- A Selection Problem of Shared Fixed Costs and Network Flows
- The traveling-salesman problem and minimum spanning trees: Part II
- Handbook of metaheuristics
This page was built for publication: Lagrangian heuristics for the quadratic knapsack problem
