Cross decomposition for mixed integer programming
From MaRDI portal
Publication:4742563
Cites work
- scientific article; zbMATH DE number 3573593 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Method of Decomposition for Integer Programs
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A resource decomposition algorithm for general mathematical programs
- Bender's method revisited
- Decomposition Principle for Linear Programs
- Partitioning procedures for solving mixed-variables programming problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
Cited in
(51)- Experimentation with Benders decomposition for solving the two-timescale stochastic generation capacity expansion problem
- Challenges in Enterprise Wide Optimization for the Process Industries
- Efficient decomposition and linearization methods for the stochastic transportation problem
- Solving the staircase cost facility location problem with decomposition and piecewise linearization
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem
- A decomposition technique for mixed integer programming problems
- Capital budgeting with Benders' decomposition
- 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
- 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
- Decomposition methods for the two-stage stochastic Steiner tree problem
- Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem
- A multi-product loading problem: A model and solution method
- Constraint partitioning in penalty formulations for solving temporal planning problems
- A production and maintenance planning model for the process industry
- 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
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- The Benders decomposition algorithm: a literature review
- A partial outer convexification approach to control transmission lines
- Mean value cross decomposition for nonlinear convex problems
- A note on node aggregation and Benders' decomposition
- Decomposition in global optimization
- On the convergence of cross decomposition
- On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs
- Multiperiod optimal planning of thermal generation using cross decomposition
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- A convergence proof for linear mean value cross decomposition
- scientific article; zbMATH DE number 61459 (Why is no real title available?)
- Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
- Decomposition in general mathematical programming
- Management of design activities in a concurrent engineering environment
- Extensions to the generalised assignment heuristic for vehicle routing
- Design of a distribution network using primal-dual decomposition
- The Benders dual decomposition method
- On using approximations of the Benders master problem
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- Solving a distribution problem with side constraints
- New bounding and decomposition approaches for MILP investment problems: multi-area transmission and generation planning under policy constraints
- Cross decomposition applied to the stochastic transportation problem
- Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- Mean value cross decomposition applied to integer programming problems
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
- A new cross decomposition method for stochastic mixed-integer linear programming
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
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)
