A comparison of feasible direction methods for the stochastic transportation problem

DOI10.1007/S10589-008-9199-0zbMATH Open1200.90133OpenAlexW2029197656MaRDI QIDQ989847FDOQ989847

Authors: Maria Daneva, Torbjörn Larsson, Michael Patriksson, C. Rydergren 

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

Recommendations

• Efficient decomposition and linearization methods for the stochastic transportation problem
• Stochastic based on multi-objective transportation problems involving normal randomness
• Stochastic optimization models for a single-sink transportation problem
• Computation of some stochastic transportation problems using Essen inequality
• scientific article; zbMATH DE number 3926637
• A stochastic approximation counterpart of the feasible direction method
• A new approach to partial constraint satisfaction problems
• Algorithm for the stochastic generalized transportation problem
• scientific article; zbMATH DE number 3920177
• scientific article; zbMATH DE number 912373

zbMATH Keywords

Cartesian product setsFrank-Wolfe method

Mathematics Subject Classification ID

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

Cites Work

• On the convergence of descent methods for monotone variational inequalities
• Minimization of functions having Lipschitz continuous first partial derivatives
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
• Origin-Based Algorithm for the Traffic Assignment Problem
• Efficient decomposition and linearization methods for the stochastic transportation problem
• Forest iteration method for stochastic transportation problem
• Cross decomposition applied to the stochastic transportation problem
• Title not available (Why is that?)
• Siting noxious facilities under uncertainty
• Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
• Title not available (Why is that?)
• Allocation under uncertainty when the demand has continuous d. f
• Stochastic transportation problems and other newtork related convex problems
• A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
• Title not available (Why is that?)
• The A-Forest Iteration Method for the Stochastic Generalized Transportation Problem
• A conjugate direction Frank-Wolfe method with applications to the traffic assignment problem

Cited In (4)

• A conjugate direction Frank-Wolfe method with applications to the traffic assignment problem
• Efficient decomposition and linearization methods for the stochastic transportation problem
• Column generation algorithms for nonlinear optimization. II: Numerical investigations
• The A-Forest Iteration Method for the Stochastic Generalized Transportation Problem

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

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