A new cross decomposition method for stochastic mixed-integer linear programming
type: Item
instance of: scholarly article
title: A new cross decomposition method for stochastic mixed-integer linear programming
zbMATH Open document ID: 1394.90440
author: Emmanuel Ogbe
author: Xiang Li
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
full work available at URL: http://hdl.handle.net/1974/27983
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 6872222
zbMATH Keywords: stochastic programming
zbMATH Keywords: mixed-integer linear programming
zbMATH Keywords: cross decomposition
zbMATH Keywords: Benders decomposition
zbMATH Keywords: Dantzig-Wolfe decomposition
describes a project that uses: GAMS
describes a project that uses: GUSS
MaRDI profile type: Publication
OpenAlex ID: W2515859521
cites work: Bender's method revisited
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: GUSS: Solving Collections of Data Related Models Within GAMS
cites work: Dual decomposition in stochastic integer programming
cites work: Benders decomposition for large-scale uncapacitated hub location
cites work: A branch-price-and-cut algorithm for multi-mode resource leveling
cites work: Decomposition Principle for Linear Programs
cites work: Column Generation
cites work: A Column Generation Approach to the Urban Transit Crew Scheduling Problem
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: The Engine Scheduling Problem In A Railway Network
cites work: About Lagrangian methods in integer optimization
cites work: Generalized Benders decomposition
cites work: Q4178782
cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds
cites work: Validation of subgradient optimization
cites work: A Generalized Approach to Dantzig-Wolfe Decomposition for Concave Programs
cites work: On the convergence of cross decomposition
cites work: Mean value cross decomposition applied to integer programming problems
cites work: Q5630824
cites work: Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
cites work: Selected Topics in Column Generation
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
cites work: Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
cites work: Reformulation of the Multiperiod MILP Model for Capacity Expansion of Chemical Processes
cites work: L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
cites work: Cross decomposition for mixed integer programming
cites work: A Cross Decomposition Algorithm for Capacitated Facility Location
cites work: Solving binary cutting stock problems by column generation and branch- and-bound
cites work: On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
cites work: A generic view of Dantzig--Wolfe decomposition in mixed integer programming
cites work: Branching in branch-and-price: A generic scheme
DOI: 10.1016/J.EJOR.2016.08.005
description: scientific article; zbMATH DE number 6872222