Improving Benders decomposition using a genetic algorithm
From MaRDI portal
Recommendations
Cites work
- A feasibility pump heuristic for general mixed-integer problems
- Accelerating Benders decomposition by local branching
- An efficient constraint handling method for genetic algorithms
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Constraint handling in genetic algorithms: the set partitioning problem
- Feature Article—Genetic Algorithms for the Operations Researcher
- Genetic algorithm based technique for solving chance constrained problems
- Handbook of applied optimization
- Improving the feasibility pump
- Large-scale mixed integer programming: Benders-type heuristics
- Partitioning procedures for solving mixed-variables programming problems
- Search Methodologies
- The feasibility pump
Cited in
(20)- Accelerating the Benders decomposition method: application to stochastic network design problems
- Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
- Multiple allocation tree of hubs location problem for non-complete networks
- Pre-positioning disaster response facilities at safe locations: an evaluation of deterministic and stochastic modeling approaches
- An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation
- scientific article; zbMATH DE number 2084693 (Why is no real title available?)
- Scheduling medical residents' training at university hospitals
- The Benders decomposition algorithm: a literature review
- Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand
- Towards merging binary integer programming techniques with genetic algorithms
- Set covering heuristics in a benders decomposition for railway timetabling
- Decomposition based hybrid metaheuristics
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- The Benders dual decomposition method
- Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach
- Boosting an exact logic-based Benders decomposition approach by variable neighborhood search
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- Solution of preemptive multi-objective network design problems applying Benders decomposition method
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
This page was built for publication: Improving Benders decomposition using a genetic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1042103)
