On generating maximal nondominated Benders cuts
From MaRDI portal
Publication:2442075
Recommendations
- Accelerating Benders decomposition with heuristic master problem solutions
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- Speed-up Benders decomposition using maximum density cut (MDC) generation
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems
Cites work
- A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A note on the selection of Benders' cuts
- A stochastic programming approach for supply chain network design under uncertainty
- A survey on Benders decomposition applied to fixed-charge network design problems
- Accelerating Benders decomposition by local branching
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Accelerating Benders method using covering cut bundle generation
- An integrated aircraft routing, crew scheduling and flight retiming model
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Cross decomposition for mixed integer programming
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- Generalized Benders decomposition
- scientific article; zbMATH DE number 4204108 (Why is no real title available?)
- scientific article; zbMATH DE number 5641435 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 949665 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- Inexact Cuts in Benders Decomposition
- Integrated Airline Fleeting and Crew-Pairing Decisions
- Integrated airline scheduling
- Large-scale mixed integer programming: Benders-type heuristics
- Local branching
- Multicommodity Distribution System Design by Benders Decomposition
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
- Partitioning procedures for solving mixed-variables programming problems
- Practical enhancements to the Magnanti-Wong method
- Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
Cited in
(38)- Practical enhancements to the Magnanti-Wong method
- Recovery strategies from major supply disruptions in single and multiple sourcing networks
- An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming
- A two-stage stochastic programming approach for influence maximization in social networks
- The Benders decomposition algorithm: a literature review
- Stochastic survivable network design problems: theory and practice
- Regularized decomposition of large scale block-structured robust optimization problems
- An improved L-shaped method for solving process flexibility design problems
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems
- An accelerated L-shaped method for solving two-stage stochastic programs in disaster management
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- Speed-up Benders decomposition using maximum density cut (MDC) generation
- Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach
- Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
- Convexity and optimization with copulæ structured probabilistic constraints
- Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition
- Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels
- Surrogate-RLT cuts for zero-one integer programs
- Minimizing conditional-value-at-risk for stochastic scheduling problems
- Accelerating the Benders decomposition method: application to stochastic network design problems
- Accelerating Benders decomposition with heuristic master problem solutions
- Supply–demand hub in industrial clusters: a stochastic approach
- A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem
- The Benders dual decomposition method
- A stochastic integer programming approach to air traffic scheduling and operations
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Large‐scale zone‐based evacuation planning—Part I: Models and algorithms
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs
- An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation
- Stabilized Benders decomposition for energy planning under climate uncertainty
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
- Literature review on Benders cut selection and a multiple cut generation scheme
- A benders-branch-and-cut methodology for global cargo vessel traffic prediction given declining arctic sea ice and changing risks
- Stochastic casualty response planning with multiple classes of patients
- Neural Benders decomposition for mixed-integer programming
- A novel Pareto-optimal cut selection strategy for Benders decomposition
This page was built for publication: On generating maximal nondominated Benders cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442075)
