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
Cites work
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A comparison of optimal methods for local access uncapacitated network design
- A genetic algorithm for the multidimensional knapsack problem
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
- A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
- A survey of very large-scale neighborhood search techniques
- A survey on Benders decomposition applied to fixed-charge network design problems
- Accelerating Benders decomposition by local branching
- 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
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- Column Generation
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Decomposition Principle for Linear Programs
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Fundamentals of scatter search and path relinking
- Generalized Benders decomposition
- Greedy randomized adaptive search procedures
- Handbook of metaheuristics
- Improving Benders decomposition using a genetic algorithm
- Inexact Cuts in Benders Decomposition
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- Local branching
- Logic-based Benders decomposition
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Metaheuristics and applications to optimization problems in telecommunications
- Models and algorithms for three-stage two-dimensional bin packing
- On the solution of traveling salesman problems
- POPMUSIC -- partial optimization metaheuristic under special intensification conditions
- Parallel Hybrid Metaheuristics
- Partitioning procedures for solving mixed-variables programming problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Recent advances in memetic algorithms.
- Selected Topics in Column Generation
- Tailoring Benders decomposition for uncapacitated network design
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The multidimensional knapsack problem: structure and algorithms
- The volume algorithm: Producing primal solutions with a subgradient method
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- Variable neighborhood decomposition search
Cited in
(22)- A branch-and-price procedure for clustering data that are graph connected
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints
- 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
- The Benders decomposition algorithm: a literature review
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- Recent advances in selection hyper-heuristics
- A study on the optimal inventory allocation for clinical trial supply chains
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
- Matheuristics: survey and synthesis
- Scheduling medical residents' training at university hospitals
- Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling
- An exact decomposition algorithm for the generalized knapsack sharing problem
- A survey of adaptive large neighborhood search algorithms and applications
- A two-phase approach for single container loading with weakly heterogeneous boxes
- Combinatorial decomposition and industrial applications.
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Metaheuristics ``In the large
- An integer programming column generation principle for heuristic search methods
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- scientific article; zbMATH DE number 5584354 (Why is no real title available?)
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)
