An extended abstract of an indepth algorithmic and computational study for maximum flow problems

DOI10.1016/0166-218X(80)90045-1zbMATH Open0452.90083MaRDI QIDQ1148822FDOQ1148822

Authors: Fred Glover, David Whitman, Darwin D. Klingman, John Mote 

Publication date: 1980

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

computational studymaximum flow algorithmsextended abstractmaximum flow network problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites Work

• Title not available (Why is that?)
• A network simplex method
• Computational Comparison of Eight Methods for the Maximum Network Flow Problem

This page was built for publication: An extended abstract of an indepth algorithmic and computational study for maximum flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148822)