0-1 quadratic knapsack problem solved with VNS algorithm (Q2631284): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Said Toumi / rank
Normal rank
 
Property / author
 
Property / author: Said Toumi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2014.11.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048078357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Methods For Solving Quadratic 0–1 Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for location routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean methods for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective GRASP and tabu search for the 0-1 quadratic knapsack problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:16, 12 July 2024

scientific article
Language Label Description Also known as
English
0-1 quadratic knapsack problem solved with VNS algorithm
scientific article

    Statements