Lagrangian heuristics for the quadratic knapsack problem

DOI10.1007/S10589-015-9763-3zbMATH Open1342.90159OpenAlexW433132519MaRDI QIDQ5963311FDOQ5963311

Abilio Lucena, Jesus Ossian Cunha, L. 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

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

zbMATH Keywords

lower and upper boundsquadratic knapsack problemLagrangian heuristicsrelax-and-cut

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The quadratic knapsack problem -- a survey
• Title not available (Why is that?)
• Lower and upper bounds for the degree-constrained minimum spanning tree problem
• Validation of subgradient optimization
• Matheuristics
• Quadratic knapsack problems
• Title not available (Why is that?)
• The traveling-salesman problem and minimum spanning trees: Part II
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Handbook of metaheuristics
• Discrete-Variable Extremum Problems
• 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
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
• Exact Solution of the Quadratic Knapsack Problem
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• Linear programming for the \(0-1\) quadratic knapsack problem
• Lagrangean methods for the 0-1 quadratic knapsack problem
• Title not available (Why is that?)
• Non delayed relax-and-cut algorithms
• A Selection Problem of Shared Fixed Costs and Network Flows
• A new upper bound for the 0-1 quadratic knapsack problem
• A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
• Quadratic knapsack relaxations using cutting planes and semidefinite programming
• 0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization
• A relax-and-cut algorithm for the set partitioning problem
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
• Title not available (Why is that?)

Cited In (5)

• Lagrangian matheuristics for the quadratic multiple knapsack problem
• Parametric convex quadratic relaxation of the quadratic knapsack problem
• A Lagrangian dual and surrogate method for multi-dimensional quadratic knapsack problems
• 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

Uses Software

• Knapsack

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)