Decomposition based hybrid metaheuristics
type: Item
instance of: scholarly article
title: Decomposition based hybrid metaheuristics
zbMATH Open document ID: 1346.90827
author: Günther R. Raidl
published in: European Journal of Operational Research
publication date: 2016-10-06T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6633487
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: metaheuristics
zbMATH Keywords: mixed integer programming
zbMATH Keywords: hybrid optimization approaches
zbMATH Keywords: decomposition techniques
describes a project that uses: SearchCol
describes a project that uses: Scatter Search
describes a project that uses: POPMUSIC
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.ejor.2014.12.005
OpenAlex ID: W2049819625
cites work: A survey of very large-scale neighborhood search techniques
cites work: Kernel search: a general heuristic for the multi-dimensional knapsack problem
cites work: On the solution of traveling salesman problems
cites work: An adaptive large neighborhood search for a vehicle routing problem with multiple routes
cites work: The volume algorithm: Producing primal solutions with a subgradient method
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Benders decomposition, Lagrangean relaxation and metaheuristic design
cites work: A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
cites work: A survey on Benders decomposition applied to fixed-charge network design problems
cites work: Parallel Hybrid Metaheuristics
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Decomposition Principle for Linear Programs
cites work: Column Generation
cites work: Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
cites work: Greedy randomized adaptive search procedures
cites work: Local branching
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Generalized Benders decomposition
cites work: Fundamentals of scatter search and path relinking
cites work: Variable neighborhood decomposition search
cites work: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
cites work: Recent advances in memetic algorithms.
cites work: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
cites work: Planning and Scheduling by Logic-Based Benders Decomposition
cites work: Logic-based Benders decomposition
cites work: Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
cites work: Q4821303
cites work: Selected Topics in Column Generation
cites work: Tailoring Benders decomposition for uncapacitated network design
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: Q5294044
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
cites work: Improving Benders decomposition using a genetic algorithm
cites work: An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
cites work: Models and algorithms for three-stage two-dimensional bin packing
cites work: The multidimensional knapsack problem: structure and algorithms
cites work: Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
cites work: Handbook of metaheuristics
cites work: A comparison of optimal methods for local access uncapacitated network design
cites work: Accelerating Benders decomposition by local branching
cites work: POPMUSIC -- partial optimization metaheuristic under special intensification conditions
cites work: Q4054818
cites work: Inexact Cuts in Benders Decomposition
DOI: 10.1016/J.EJOR.2014.12.005
description: scientific article; zbMATH DE number 6633487