Decomposition based hybrid metaheuristics
From MaRDI portal
Publication:319285
DOI10.1016/J.EJOR.2014.12.005zbMATH Open1346.90827OpenAlexW2049819625MaRDI QIDQ319285FDOQ319285
Authors: Günther R. Raidl 
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.12.005
Recommendations
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- Decomposition techniques for hybrid MILP/CP models applied to scheduling and routing problems
- Combinatorial decomposition and industrial applications.
- Hybrid metaheuristics in combinatorial optimization: a tutorial
combinatorial optimizationmetaheuristicsmixed integer programmingdecomposition techniqueshybrid optimization approaches
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- POPMUSIC -- partial optimization metaheuristic under special intensification conditions
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Improving Benders decomposition using a genetic algorithm
- Partitioning procedures for solving mixed-variables programming problems
- Accelerating Benders decomposition by local branching
- Inexact Cuts in Benders Decomposition
- Selected Topics in Column Generation
- Logic-based Benders decomposition
- Local branching
- A comparison of optimal methods for local access uncapacitated network design
- Generalized Benders decomposition
- Planning and Scheduling by Logic-Based Benders Decomposition
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- On the solution of traveling salesman problems
- Fundamentals of scatter search and path relinking
- Exploring relaxation induced neighborhoods to improve MIP solutions
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- Title not available (Why is that?)
- Handbook of metaheuristics
- A survey of very large-scale neighborhood search techniques
- Decomposition Principle for Linear Programs
- Column Generation
- The volume algorithm: Producing primal solutions with a subgradient method
- Greedy randomized adaptive search procedures
- The multidimensional knapsack problem: structure and algorithms
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- A genetic algorithm for the multidimensional knapsack problem
- Recent advances in memetic algorithms.
- A survey on Benders decomposition applied to fixed-charge network design problems
- Variable neighborhood decomposition search
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
- Models and algorithms for three-stage two-dimensional bin packing
- A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- Parallel Hybrid Metaheuristics
- Tailoring Benders decomposition for uncapacitated network design
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- Metaheuristics and applications to optimization problems in telecommunications
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
Cited In (22)
- Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints
- Scheduling medical residents' training at university hospitals
- The Benders decomposition algorithm: a literature review
- Decomposition techniques for hybrid MILP/CP models applied to scheduling and routing problems
- A matheuristic approach for the design of multiproduct batch plants with parallel production lines
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- A study on the optimal inventory allocation for clinical trial supply chains
- Recent advances in selection hyper-heuristics
- Matheuristics: survey and synthesis
- A two-phase approach for single container loading with weakly heterogeneous boxes
- Metaheuristics ``In the large
- An exact decomposition algorithm for the generalized knapsack sharing problem
- A survey of adaptive large neighborhood search algorithms and applications
- Title not available (Why is that?)
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- A branch-and-price procedure for clustering data that are graph connected
- Combinatorial decomposition and industrial applications.
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
- An integer programming column generation principle for heuristic search methods
Uses Software
This page was built for publication: Decomposition based hybrid metaheuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319285)
