Bringing order into the neighborhoods: Relaxation guided variable neighborhood search

DOI10.1007/s10732-007-9048-9zbMath1211.90315OpenAlexW2029941120MaRDI QIDQ953317

Günther R. Raidl, Jakob Puchinger

Publication date: 17 November 2008

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01224918/file/puchinger-06a.pdf

zbMATH Keywords

integer linear programmingvariable neighborhood searchmultidimensional Knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

New convergent heuristics for 0-1 mixed integer programming, A recipe for finding good solutions to MINLPs, Learning variable neighborhood search for a scheduling problem with time windows and rejections, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, Order matters -- a variable neighborhood search for the swap-body vehicle routing problem, Bringing order into the neighborhoods: Relaxation guided variable neighborhood search, Variable neighbourhood search: methods and applications, Matheuristic for the decentralized factories scheduling problem, Variable neighbourhood search for financial derivative problem, Variable neighbourhood search: Methods and applications

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
• A genetic algorithm for the multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• The core concept for the Multidimensional Knapsack problem
• Improved results on the 0--1 multidimensional knapsack problem
• The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
• On the Solution of Discrete Programming Problems
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• Variable Neighborhood Search
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
• The Theory and Computation of Knapsack Functions