0-1 quadratic knapsack problem solved with VNS algorithm
From MaRDI portal
Publication:2631284
DOI10.1016/j.endm.2014.11.035zbMath1362.90329OpenAlexW2048078357MaRDI QIDQ2631284
Mohamed Cheikh, Bassem Jarboui, Said Toumi
Publication date: 29 July 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2014.11.035
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (5)
Portfolio decision analysis with a generalized balance approach ⋮ 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 ⋮ Multiple traveling salesperson problem with drones: general variable neighborhood search approach ⋮ Variable neighbourhood search for financial derivative problem
Cites Work
- Unnamed Item
- Variable neighborhood search for location routing
- An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Quadratic knapsack problems
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- Variable neighborhood search: Principles and applications
This page was built for publication: 0-1 quadratic knapsack problem solved with VNS algorithm