A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
From MaRDI portal
Publication:4147875
DOI10.1287/mnsc.24.3.312zbMath0371.90102OpenAlexW1967113490MaRDI QIDQ4147875
Publication date: 1977
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.24.3.312
Related Items
Hub location problems with price sensitive demands, On using approximations of the Benders master problem, Implementing Automatic Benders Decomposition in a Modern MIP Solver, Multiple allocation hub-and-spoke network design under hub congestion, New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty, Benders decomposition applied to profit maximizing hub location problem with incomplete hub network, New bounding and decomposition approaches for MILP investment problems: multi-area transmission and generation planning under policy constraints, Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition, Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles, Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels, A note on the selection of Benders' cuts, A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks, Benders Decomposition for Production Routing Under Demand Uncertainty, Exact approaches for static data segment allocation problem in an information network, A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs, Combining Benders decomposition and column generation for multi-activity tour scheduling, Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain, Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty, An integrated model for logistics network design, Designing cost-effective content distribution networks, A hybrid approach of bundle and Benders applied large mixed linear integer problem, Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty, A two-stage stochastic programming approach for multi-activity tour scheduling, Minimizing conditional-value-at-risk for stochastic scheduling problems, Accelerating Benders decomposition: multiple cuts via multiple solutions, An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation, Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing, A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach, An interior-point Benders based branch-and-cut algorithm for mixed integer programs, On generating maximal nondominated Benders cuts, 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, An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions, A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture, A decomposition approach to the two-stage stochastic unit commitment problem, Recovery strategies from major supply disruptions in single and multiple sourcing networks, The Benders Dual Decomposition Method, Exact algorithms for the joint object placement and request routing problem in content distribution networks, Exact and heuristic solution approaches for the mixed integer setup knapsack problem, Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems, Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines, Accelerating benders decomposition with heuristicmaster problem solutions, Integrated airline scheduling, Accelerating Benders method using covering cut bundle generation, Solving minimum-cost shared arborescence problems, The Benders decomposition algorithm: a literature review, Mixed-integer bilinear programming problems, A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints, 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, Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand, A nested benders decomposition approach for telecommunication network planning, A Benders decomposition approach for the robust spanning tree problem with interval data, Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework, Practical enhancements to the Magnanti-Wong method, Solving network design problems via iterative aggregation, Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion, Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints, Inexact Cuts in Stochastic Dual Dynamic Programming, Exact solution methods for uncapacitated location problems with convex transportation costs, On a Three-Level Competitive Pricing Problem with Uniform and Mill Pricing Strategies, On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs, Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version, Exact Multiple Sequence Alignment by Synchronized Decision Diagrams, Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization, Comparative approaches to equipment scheduling in high volume factories, Cross decomposition for mixed integer programming, Bender's method revisited, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, Decentralization model with flexible multi-goals and concessions, Capital budgeting with Benders' decomposition, An L-shaped method with strengthened lift-and-project cuts, Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
