Pages that link to "Item:Q2638375"
From MaRDI portal
The following pages link to A note on the selection of Benders' cuts (Q2638375):
Displaying 50 items.
- Hub location problems with price sensitive demands (Q264310) (← links)
- Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
- On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
- Recoverable robust single day aircraft maintenance routing problem (Q337121) (← links)
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (Q342011) (← links)
- The robust set covering problem with interval data (Q367647) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
- Improving the performance of stochastic dual dynamic programming (Q492066) (← links)
- Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization (Q779756) (← links)
- New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty (Q1628038) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620) (← links)
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems (Q1725627) (← links)
- The Benders decomposition algorithm: a literature review (Q1751891) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem (Q1754726) (← links)
- Scheduling medical residents' training at university hospitals (Q1755256) (← links)
- A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
- The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT) (Q1991143) (← links)
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems (Q2074837) (← links)
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
- Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics (Q2103001) (← links)
- Nonlinear chance-constrained problems with applications to hydro scheduling (Q2118083) (← links)
- Robust min-max regret covering problems (Q2162527) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- Identifying relatively irreducible infeasible subsystems of linear inequalities (Q2241565) (← links)
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
- Optimizing over pure stationary equilibria in consensus stopping games (Q2281451) (← links)
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
- ``Facet'' separation with one linear program (Q2330653) (← links)
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs (Q2442074) (← links)
- On generating maximal nondominated Benders cuts (Q2442075) (← links)
- A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture (Q2442084) (← links)
- Solving network design problems via iterative aggregation (Q2516352) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
- Benders decomposition for a node-capacitated virtual network function placement and routing problem (Q2668658) (← links)
- Benders decomposition for network design covering problems (Q2669611) (← links)
- On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs (Q2835657) (← links)
- Exact approaches to the single-source network loading problem (Q2892148) (← links)
- Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← links)
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm (Q5058020) (← links)
- Benders Subproblem Decomposition for Bilevel Problems with Convex Follower (Q5087737) (← links)
- A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem (Q5095157) (← links)
- On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs (Q5106425) (← links)
- The Benders Dual Decomposition Method (Q5130513) (← links)
- Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)
- A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty (Q6062880) (← links)
