Bringing order into the neighborhoods: Relaxation guided variable neighborhood search

DOI10.1007/s10732-007-9048-9zbMath1211.90315MaRDI 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 programming; variable neighborhood search; multidimensional Knapsack problem

Mathematics Subject Classification ID

90C10: Integer programming

90C05: Linear programming

90C59: Approximation methods and heuristics in mathematical programming

Related Items

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

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