A comparison of feasible direction methods for the stochastic transportation problem

DOI10.1007/s10589-008-9199-0zbMath1200.90133OpenAlexW2029197656MaRDI QIDQ989847

Maria Daneva, Torbjörn Larsson, Clas Rydergren, Michael Patriksson

Publication date: 23 August 2010

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-008-9199-0

zbMATH Keywords

Frank-Wolfe methodCartesian product sets

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

Related Items (1)

Column generation algorithms for nonlinear optimization. II: Numerical investigations

Cites Work

• Cross decomposition applied to the stochastic transportation problem
• A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
• On the convergence of descent methods for monotone variational inequalities
• Efficient decomposition and linearization methods for the stochastic transportation problem
• Minimization of functions having Lipschitz continuous first partial derivatives
• Allocation under Uncertainty when the Demand has Continuous D.F.
• Forest iteration method for stochastic transportation problem
• Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
• The A-Forest Iteration Method for the Stochastic Generalized Transportation Problem
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
• Stochastic transportation problems and other newtork related convex problems
• Origin-Based Algorithm for the Traffic Assignment Problem
• Siting noxious facilities under uncertainty
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A comparison of feasible direction methods for the stochastic transportation problem