Decomposition based hybrid metaheuristics
From MaRDI portal
Publication:319285
DOI10.1016/j.ejor.2014.12.005zbMath1346.90827OpenAlexW2049819625MaRDI QIDQ319285
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
combinatorial optimizationmetaheuristicsmixed integer programmingdecomposition techniqueshybrid optimization approaches
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints, A matheuristic approach for the design of multiproduct batch plants with parallel production lines, An exact decomposition algorithm for the generalized knapsack sharing problem, Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization, Decomposition-based algorithms for the crew scheduling and routing problem in road restoration, Recent advances in selection hyper-heuristics, A survey of adaptive large neighborhood search algorithms and applications, Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling, A three-phase matheuristic algorithm for the multi-day task assignment problem, Matheuristics: survey and synthesis, An integer programming column generation principle for heuristic search methods, Metaheuristics ``In the large, A study on the optimal inventory allocation for clinical trial supply chains, The Benders decomposition algorithm: a literature review, Scheduling medical residents' training at university hospitals, A branch-and-price procedure for clustering data that are graph connected, A two-phase approach for single container loading with weakly heterogeneous boxes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- A survey of very large-scale neighborhood search techniques
- 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
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Improving Benders decomposition using a genetic algorithm
- On the solution of traveling salesman problems
- Partitioning procedures for solving mixed-variables programming problems
- A genetic algorithm for the multidimensional knapsack problem
- Logic-based Benders decomposition
- Local branching
- The volume algorithm: Producing primal solutions with a subgradient method
- A comparison of optimal methods for local access uncapacitated network design
- Recent advances in memetic algorithms.
- A survey on Benders decomposition applied to fixed-charge network design problems
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Greedy randomized adaptive search procedures
- Variable neighborhood decomposition search
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
- Generalized Benders decomposition
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- 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
- The Multidimensional Knapsack Problem: Structure and Algorithms
- Accelerating Benders Decomposition by Local Branching
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Decomposition Principle for Linear Programs
- Planning and Scheduling by Logic-Based Benders Decomposition
- Parallel Hybrid Metaheuristics
- Tailoring Benders decomposition for uncapacitated network design
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- Inexact Cuts in Benders Decomposition
- Column Generation
- Selected Topics in Column Generation
- Handbook of metaheuristics
