Cross decomposition for mixed integer programming

DOI10.1007/BF02591718zbMATH Open0505.90057OpenAlexW4362223616MaRDI QIDQ4742563FDOQ4742563

Authors: Tony J. van Roy 

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

duality gapBenders decompositionLagrangean relaxationcapacitated facility location problemLagrangean multipliersmixed integer linear programscross- decompositionprimal and dual substructure

Mathematics Subject Classification ID

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

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Title not available (Why is that?)
• Decomposition Principle for Linear Programs
• A Method of Decomposition for Integer Programs
• Title not available (Why is that?)
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A resource decomposition algorithm for general mathematical programs
• Title not available (Why is that?)
• Bender's method revisited

Cited In (51)

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

This page was built for publication: Cross decomposition for mixed integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4742563)