On generating maximal nondominated Benders cuts
From MaRDI portal
Publication:2442075
DOI10.1007/s10479-011-0883-6zbMath1288.90055OpenAlexW1969782132MaRDI QIDQ2442075
Hanif D. Sherali, Brian J. Lunday
Publication date: 31 March 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0883-6
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, Supply–demand hub in industrial clusters: a stochastic approach, 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, A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem, Minimizing conditional-value-at-risk for stochastic scheduling 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, Accelerating Benders decomposition: multiple cuts via multiple solutions, An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation, Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach, 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, The Benders Dual Decomposition Method, A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations, Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems, Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines, 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, An accelerated L-shaped method for solving two-stage stochastic programs in disaster management, Convexity and optimization with copulæ structured probabilistic constraints, Refined cut selection for Benders decomposition: applied to network capacity expansion problems, Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large-scale mixed integer programming: Benders-type heuristics
- An integrated aircraft routing, crew scheduling and flight retiming model
- Integrated airline scheduling
- Practical enhancements to the Magnanti-Wong method
- Partitioning procedures for solving mixed-variables programming problems
- Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- Local branching
- A survey on Benders decomposition applied to fixed-charge network design problems
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
- A stochastic programming approach for supply chain network design under uncertainty
- Generalized Benders decomposition
- A note on the selection of Benders' cuts
- Accelerating Benders Decomposition by Local Branching
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Integrated Airline Fleeting and Crew-Pairing Decisions
- Accelerating Benders method using covering cut bundle generation
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Inexact Cuts in Benders Decomposition
- Cross decomposition for mixed integer programming
