Develops a price-directive algorithm for solving the minimum cost multicommodity flow problem. The algorithm is a specialization of Balas' infeasibility pricing method. The subproblems are first solved and the infeasibility in the common resources is used to generate a new direction for the price vector. By making use of the network structure, the process of finding the new direction is simplified. The subproblems are solved only once and the procedure is illustrated by a numerical example.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An infeasibility pricing algorithm for the multicommodity minimum cost flow problem


    Additional title:

    Ein Algorithmus des nichterhaeltlichen Preises fuer das Problem minimaler Warenkosten


    Contributors:

    Published in:

    Publication date :

    1978


    Size :

    11 Seiten, 25 Quellen



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    Cost Optimisation Tool for Multicommodity Network Flow Problem in Telecommunications

    Snežana MLADENOVIĆ / Ivana STEFANOVIĆ / Slađana JANKOVIĆ et al. | DOAJ | 2024

    Free access

    Applying Quantum Computing to Solve Multicommodity Network Flow Problem

    Niu, Chence / Rastogi, Purvi / Soman, Jaikishan et al. | IEEE | 2025


    The congested multicommodity network design problem

    Dimitris C Paraskevopoulos | Online Contents | 2016


    The Multicommodity-Ring Location Routing Problem

    Gianessi, Paolo | Online Contents | 2016


    The Multicommodity-Ring Location Routing Problem

    Gianessi, Paolo / Alfandari, Laurent / Létocart, Lucas et al. | British Library Online Contents | 2016