Logic-based Benders decomposition for large-scale optimization
From MaRDI portal
Abstract: Logic-based Benders decomposition (LBBD) is a substantial generalization of classical Benders decomposition that, in principle, allows the subproblem to be any optimization problem rather than specifically a linear or nonlinear programming problem. It is amenable to a wide variety large-scale problems that decouple or otherwise simplify when certain decision variables are fixed. This chapter presents the basic theory of LBBD and explains how classical Benders decomposition is a special case. It also describes branch and check, a variant of LBBD that solves the master problem only once. It illustrates in detail how Benders cuts and subproblem relaxations can be developed for some planning and scheduling problems. It then describes the role of LBBD in three large-scale case studies. The chapter concludes with an extensive survey of the LBBD literature, organized by problem domain, to allow the reader to explore how Benders cuts have been developed for a wide range of applications.
Recommendations
Cites work
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem
- A Benders approach for the constrained minimum break problem
- A Benders approach to the minimum chordal completion problem
- A Benders decomposition approach to deciding modular linear integer arithmetic
- A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- A branch-and-check approach for a wind turbine maintenance scheduling problem
- A combinatorial Benders' decomposition for the lock scheduling problem
- A constraint programming approach for solving a queueing design and control problem
- A decomposition approach for solving a broadcast domination network design problem
- A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems
- A hybrid method for the planning and scheduling
- A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- A logic-based benders decomposition approach for the 3-staged strip packing problem
- A logic-based Benders decomposition approach to improve coordination of inland vessels for inter-terminal transport
- A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines
- Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
- An integrated method for planning and scheduling to minimize tardiness
- An integrated solver for optimization problems
- An LPCC approach to nonconvex quadratic programs
- Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
- Benders' cuts guided large neighborhood search for the traveling umpire problem
- Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
- Boosting an exact logic-based Benders decomposition approach by variable neighborhood search
- Collaborative operating room planning and scheduling
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Combinatorial Benders' cuts for the strip packing problem
- Combining Benders decomposition and column generation for multi-activity tour scheduling
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Cutting plane algorithms for solving a stochastic edge-partition problem
- Decomposition methods for the parallel machine scheduling problem with setups
- Generalized Benders decomposition
- scientific article; zbMATH DE number 2084694 (Why is no real title available?)
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- scientific article; zbMATH DE number 2243370 (Why is no real title available?)
- Inexact Cuts in Benders Decomposition
- Integrated methods for optimization
- Integrated methods for optimization.
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Logic-based Benders decomposition
- Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups
- Logic-Based Decomposition Methods for the Travelling Purchaser Problem
- Logic-based MultiObjective Optimization for Restoration Planning
- Mixed integer programming versus logic-based Benders decomposition for planning and scheduling
- Modelling and solving the senior transportation problem
- Multi-stage Benders Decomposition for Optimizing Multicore Architectures
- On convex quadratic programs with linear complementarity constraints
- On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Optimal resource allocation and scheduling for the CELL BE platform
- Optimal torpedo scheduling
- Optimization Bounds from the Branching Dual
- Partitioning procedures for solving mixed-variables programming problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Principles and Practice of Constraint Programming – CP 2004
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- Recent Advances in Constraints
- Robust scheduling with logic-based Benders decomposition
- Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources
- Scheduling a triple round robin tournament for the best Danish soccer league
- Scheduling home hospice care with logic-based Benders decomposition
- Single-facility scheduling by logic-based Benders decomposition
- Single-facility scheduling over long time horizons by logic-based Benders decomposition
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- Solving an integrated job-shop problem with human resource constraints
- Solving planning and scheduling problems with combined integer and constraint programming
- Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip
- The Benders decomposition algorithm: a literature review
- The stop-and-drop problem in nonprofit food distribution networks
- Two-level decomposition algorithm for crew rostering problems with fair working condition
- Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
Cited in
(26)- Logic-based Benders decomposition
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- Exact optimization and decomposition approaches for shelf space allocation
- Strengthening of feasibility cuts in logic-based benders decomposition
- Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms
- Boosting an exact logic-based Benders decomposition approach by variable neighborhood search
- Assembly planning by disjunctive programming and geometrical reasoning
- Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling
- scientific article; zbMATH DE number 3843497 (Why is no real title available?)
- Stochastic planning and scheduling with logic-based Benders decomposition
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems
- Multi-stage Benders Decomposition for Optimizing Multicore Architectures
- Logic-based Benders decomposition for wildfire suppression
- Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition
- Combining optimisation and simulation using logic-based Benders decomposition
- Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut
- The two-echelon stochastic multi-period capacitated location-routing problem
- Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
- Subproblem separation in logic-based Benders' decomposition for the vehicle routing problem with local congestion
- Robust parallel machine selection and scheduling with uncertain release times
- Smart automated guided vehicle scheduling with flexible battery management: a new formulation and an exact approach
- Solving a multi-resolution model of the train platforming problem using Lagrangian relaxation with dynamic multiplier aggregation
- One Benders cut to rule all schedules in the neighbourhood
- A generalized Benders decomposition approach for the optimal design of a local multi-energy system
- Improving the efficiency of logic-based benders decomposition for p-batch scheduling problems with two-dimensional packing
This page was built for publication: Logic-based Benders decomposition for large-scale optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296379)
