Lagrangian heuristics for the quadratic knapsack problem
From MaRDI portal
Publication:5963311
Recommendations
- Lagrangian matheuristics for the quadratic multiple knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- A dynamic programming heuristic for the quadratic knapsack problem
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- Approximation of the quadratic knapsack problem
- Approximation of the quadratic knapsack problem
Cites work
- scientific article; zbMATH DE number 4112385 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1302173 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 5173819 (Why is no real title available?)
- 0-1 quadratic knapsack problems: an exact approach based on a \(t\)-linearization
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- A Selection Problem of Shared Fixed Costs and Network Flows
- A dynamic programming heuristic for the quadratic knapsack problem
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
- A new upper bound for the 0-1 quadratic knapsack problem
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
- A relax-and-cut algorithm for the set partitioning problem
- A semidefinite programming approach to the quadratic knapsack problem
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Discrete-variable extremum problems
- Exact Solution of the Quadratic Knapsack Problem
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- Handbook of metaheuristics
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- Matheuristics
- Min-cut clustering
- Non delayed relax-and-cut algorithms
- Quadratic knapsack problems
- Quadratic knapsack relaxations using cutting planes and semidefinite programming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The quadratic knapsack problem -- a survey
- The traveling-salesman problem and minimum spanning trees: Part II
- Validation of subgradient optimization
Cited in
(6)- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A Lagrangian dual and surrogate method for multi-dimensional quadratic knapsack problems
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- Lagrangian matheuristics for the quadratic multiple knapsack problem
This page was built for publication: Lagrangian heuristics for the quadratic knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963311)
