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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An infeasibility pricing algorithm for the multicommodity minimum cost flow problem


    Weitere Titelangaben:

    Ein Algorithmus des nichterhaeltlichen Preises fuer das Problem minimaler Warenkosten


    Beteiligte:
    Bazaraa, M.S. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1978


    Format / Umfang :

    11 Seiten, 25 Quellen



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    Cost Optimisation Tool for Multicommodity Network Flow Problem in Telecommunications

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

    Freier Zugriff

    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