Primary simplex method for flow network

• Autorzy: Janusz Jabłonowski , Krystian Zorychta
• Języki publikacji: EN

Abstrakty

EN

This paper describes an efficient network simplex algorithm for solving minimum-cost network flow problems. The algorithm derives from a theoretical characterization of the network topology of the basis embodied in a specially constructed basis tree. Experimentation with large sparse mini- mum-cost network flow problems has shown that in practice good implemen-tation of the network simplex method is more efficient than other implemen-tations based on special network flow methods.

PL

.

Słowa kluczowe

EN

Programming involving graphs or networks

• Wydawca: Polish Mathematical Society
• Czasopismo: Mathematica Applicanda
• Rocznik: 1990
• Tom: 18
• Numer: 32

Daty

wydano

1990

online

1990-03-01

Twórcy

autor

Janusz Jabłonowski

autor

Krystian Zorychta

Identyfikatory

DOI

10.14708/ma.v18i32.1737