Cross decomposition applied to the stochastic transportation problem (Q799587): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Kurt O. Jørnsten / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jitka Dupačová / rank
Normal rank
 
Property / author
 
Property / author: Kurt O. Jørnsten / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Jitka Dupačová / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(84)90131-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017504154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the choice of step size in subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic transportation problems and other newtork related convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5569992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3865842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of two-segment separable programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross decomposition for mixed integer programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:39, 14 June 2024

scientific article
Language Label Description Also known as
English
Cross decomposition applied to the stochastic transportation problem
scientific article

    Statements

    Cross decomposition applied to the stochastic transportation problem (English)
    0 references
    0 references
    0 references
    1984
    0 references
    The cross decomposition method for integer programming applied to the stochastic transportation problem exploits the simple structure of the subproblems corresponding both to the Benders and the Dantzig-Wolfe decomposition methods. Computational results are given for a number of large-scale test problems and the efficiency of the method is compared with the Frank-Wolfe and separable programming methods for the stochastic transportation problem.
    0 references
    Frank-Wolfe algorithm
    0 references
    separable programming
    0 references
    networks
    0 references
    cross decomposition method
    0 references
    stochastic transportation problem
    0 references
    Computational results
    0 references
    large-scale test problems
    0 references

    Identifiers