Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
From MaRDI portal
Publication:953317
DOI10.1007/S10732-007-9048-9zbMATH Open1211.90315OpenAlexW2029941120MaRDI QIDQ953317FDOQ953317
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
Recommendations
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)
Cites Work
- Variable Neighborhood Search
- Improved results on the 0--1 multidimensional knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- On the Solution of Discrete Programming Problems
- The Theory and Computation of Knapsack Functions
- Title not available (Why is that?)
- The core concept for the Multidimensional Knapsack problem
- The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Title not available (Why is that?)
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
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
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A recipe for finding good solutions to MINLPs
- 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
Uses Software
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)
