Efficient decomposition and linearization methods for the stochastic transportation problem
type: Item
instance of: scholarly article
title: Efficient decomposition and linearization methods for the stochastic transportation problem
zbMATH Open document ID: 0844.90060
DOI: 10.1007/BF01300860
author: Kaj Holmberg
published in: Computational Optimization and Applications
publication date: 1996-02-28T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 849059
zbMATH Keywords: Frank-Wolfe method
zbMATH Keywords: stochastic transportation problem
zbMATH Keywords: convex transportation problem
zbMATH Keywords: nonlinear objective function
zbMATH Keywords: subgradient optimization
MaRDI profile type: Publication
cites work: Q3932576
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Q4133397
cites work: Stochastic transportation problems and other newtork related convex problems
cites work: Q4105990
cites work: Decomposition Principle for Linear Programs
cites work: Allocation under uncertainty when the demand has continuous d. f
cites work: Validation of subgradient optimization
cites work: Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
cites work: A convergence proof for linear mean value cross decomposition
cites work: Cross decomposition applied to the stochastic transportation problem
cites work: Two-Level Planning
cites work: An algorithm for nonlinear programs over Cartesian product sets
cites work: Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
cites work: Minimization of unsmooth functionals
cites work: Forest iteration method for stochastic transportation problem
cites work: Cross decomposition for mixed integer programming
cites work: A Stochastic Transportation Problem
description: scientific article; zbMATH DE number 849059