A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
From MaRDI portal
Publication:4147875
DOI10.1287/mnsc.24.3.312zbMath0371.90102MaRDI 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
Cross decomposition for mixed integer programming, Accelerating benders decomposition with heuristicmaster problem solutions, Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing, Mixed-integer bilinear programming problems, Multiple allocation hub-and-spoke network design under hub congestion, An integrated model for logistics network design, Designing cost-effective content distribution networks, 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, Integrated airline scheduling, Practical enhancements to the Magnanti-Wong method, Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version, Bender's method revisited, Capital budgeting with Benders' decomposition, On using approximations of the Benders master problem, Exact solution methods for uncapacitated location problems with convex transportation costs, A Benders decomposition approach for the robust spanning tree problem with interval data, Comparative approaches to equipment scheduling in high volume factories, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, A note on the selection of Benders' cuts, Accelerating Benders method using covering cut bundle generation, A nested benders decomposition approach for telecommunication network planning, Decentralization model with flexible multi-goals and concessions
