Submodulare Flüsse: Verfahren zur Minimierung linearer Zielfunktionen

Zimmermann, Uwe (1984) Submodulare Flüsse: Verfahren zur Minimierung linearer Zielfunktionen.
Technical Report , 40 p.

Abstract

We survey algebraic and algorithmic aspects of the submodular flow problem. After some motivating remarks on the usual network flow problem module-valued submodular flows are discussed. Main emphasis lies on a combinatorial development of the primal-dual method (potential method) of Cunningham and Frank in arbitrary modules. That approach enables the proof of a strong duality theorem in arbitrary modules. Finally, a comprehensive list of references is included.


Actions:
Full text not available from this repository.
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Paper (Technical Report)
Citations: No citation data.
Uncontrolled Keywords: algebraic and algorithmic aspects module-valued submodular flows primal-dual method strong duality theorem in arbitrary modules submodular flow problem
Subjects:
  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C10 Integer programming

  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C35 Programming involving graphs or networks

  • 90-XX Operations research, mathematical programming > 90Bxx Operations research and management science > 90B10 Network models, deterministic

    		•
    Divisions: Mathematical Institute
    Related URLs:
      Deposit Information:
      ZAIK Number: zpr84-010
      Depositing User: Archive Admin
      Date Deposited: 02 Apr 2001 00:00
      Last Modified: 24 Nov 2011 16:32
      URI: http://e-archive.informatik.uni-koeln.de/id/eprint/10