Bringing order into the neighborhoods: Relaxation guided variable neighborhood search

DOI10.1007/S10732-007-9048-9MaRDI QIDQ953317zbMATH OpenOpenAlexFDO

Authors Jakob Puchinger, Günther R. Raidl

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

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

Recommendations

• scientific article; zbMATH DE number 1488097
• Variable neighborhood search: Principles and applications
• Variable Neighborhood Search
• Variable neighborhood search
• Developments of variable neighborhood search

Cites work

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

Cited in

(12)

• Learning variable neighborhood search for a scheduling problem with time windows and rejections
• 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
• A recipe for finding good solutions to MINLPs
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Variable neighbourhood search for financial derivative problem
• Algorithms for the bin packing problem with scenarios
• Matheuristic for the decentralized factories scheduling problem
• Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
• New convergent heuristics for 0-1 mixed integer programming

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Bringing order into the neighborhoods: Relaxation guided variable neighborhood search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953317)