A note on the selection of Benders' cuts
From MaRDI portal
Publication:2638375
DOI10.1007/s10107-010-0365-7zbMath1198.90302OpenAlexW1984952615MaRDI QIDQ2638375
Arrigo Zanette, Matteo Fischetti, Domenico Salvagnin
Publication date: 16 September 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0365-7
Related Items
Hub location problems with price sensitive demands, Implementing Automatic Benders Decomposition in a Modern MIP Solver, Exact approaches to the single-source network loading problem, New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty, A survey of variants and extensions of the location-routing problem, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm, Surrogate-RLT cuts for zero-one integer programs, On exact solutions for the minmax regret spanning tree problem, Recoverable robust single day aircraft maintenance routing problem, A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs, Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain, Robust min-max regret covering problems, An exact extended formulation for the unrelated parallel machine total weighted completion time problem, The robust set covering problem with interval data, Benders decomposition approach for the robust network design problem with flow bifurcations, Benders Subproblem Decomposition for Bilevel Problems with Convex Follower, Strong lift-and-project cutting planes for the stable set problem, Benders decomposition for a node-capacitated virtual network function placement and routing problem, Benders decomposition for network design covering problems, A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem, A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty, On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs, Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing, Outer-product-free sets for polynomial optimization and oracle-based cuts, Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing, Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty, An interior-point Benders based branch-and-cut algorithm for mixed integer programs, On generating maximal nondominated Benders cuts, A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture, The Benders Dual Decomposition Method, Benders decomposition for very large scale partial set covering and maximal covering location problems, The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems, Improving the performance of stochastic dual dynamic programming, Identifying relatively irreducible infeasible subsystems of linear inequalities, The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT), The Benders decomposition algorithm: a literature review, Stochastic survivable network design problems: theory and practice, Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem, Scheduling medical residents' training at university hospitals, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, Optimizing over pure stationary equilibria in consensus stopping games, A new formulation and an exact approach for the many-to-many hub location-routing problem, Solving network design problems via iterative aggregation, Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints, On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs, Refined cut selection for Benders decomposition: applied to network capacity expansion problems, A tailored Benders decomposition approach for last-mile delivery with autonomous robots, Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization, ``Facet separation with one linear program, Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics, Nonlinear chance-constrained problems with applications to hydro scheduling
Cites Work
- Unnamed Item
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
- Valid inequalities for mixed integer linear programs
- Partitioning procedures for solving mixed-variables programming problems
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
- A survey on Benders decomposition applied to fixed-charge network design problems
- On capacitated network design cut-set polyhedra
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
- A convex-analysis perspective on disjunctive cuts
- Accelerating Benders Decomposition by Local Branching
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Identifying Minimally Infeasible Subsystems of Inequalities
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Valid inequalities for problems with additive variable upper bounds
