Cross decomposition for mixed integer programming

DOI10.1007/BF02591718zbMath0505.90057OpenAlexW4362223616MaRDI QIDQ4742563

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02591718

zbMATH Keywords

Lagrangean relaxation duality gap Benders decomposition capacitated facility location problem Lagrangean multipliers mixed integer linear programs cross- decomposition primal and dual substructure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11)

Related Items

On using approximations of the Benders master problem, Solving the staircase cost facility location problem with decomposition and piecewise linearization, A cross decomposition algorithm for a multiproduct-multitype facility location problem, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, Multi-item capacitated lot-sizing by a cross decomposition based algorithm, New bounding and decomposition approaches for MILP investment problems: multi-area transmission and generation planning under policy constraints, Efficient decomposition and linearization methods for the stochastic transportation problem, Multiperiod optimal planning of thermal generation using cross decomposition, A convergence proof for linear mean value cross decomposition, A hybrid approach of bundle and Benders applied large mixed linear integer problem, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, A partial outer convexification approach to control transmission lines, Solving a distribution problem with side constraints, A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines, On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs, A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints, On generating maximal nondominated Benders cuts, Speed-up Benders decomposition using maximum density cut (MDC) generation, The Benders Dual Decomposition Method, Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design, Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem, Exact and heuristic solution approaches for the mixed integer setup knapsack problem, Constraint partitioning in penalty formulations for solving temporal planning problems, Decomposition in global optimization, Decomposition methods for the two-stage stochastic Steiner tree problem, Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem, A note on node aggregation and Benders' decomposition, The Benders decomposition algorithm: a literature review, A new cross decomposition method for stochastic mixed-integer linear programming, Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem, Decomposition in general mathematical programming, Linear mean value cross decomposition: A generalization of the Kornai- Liptak method, A decomposition technique for mixed integer programming problems, Management of design activities in a concurrent engineering environment, A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs, Exact solution algorithms for the maximum flow problem with additional conflict constraints, Design of a distribution network using primal-dual decomposition, Unnamed Item, Extensions to the generalised assignment heuristic for vehicle routing, Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, On the convergence of cross decomposition, Mean value cross decomposition for nonlinear convex problems, Challenges in Enterprise Wide Optimization for the Process Industries, Mean value cross decomposition applied to integer programming problems, A multi-product loading problem: A model and solution method, Cross decomposition applied to the stochastic transportation problem, A production and maintenance planning model for the process industry, Capital budgeting with Benders' decomposition, An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type

Cites Work