Abstract
Recently, Frank and Tardos (1988) presented an algorithm, called the bi-truncation algorithm, for discerning whether a polyhedron defined by
is nonempty, whereb″ is a crossing-submodular function on 2s. We point out an error in their algorithm and show how it is corrected.
References
A. Frank and É. Tardos, “Generalized polymatroids and submodular flows,”Mathematical Programming 42 (1988) 489–563.
S. Fujishige, “Structures of polyhedra determined by submodular functions on crossing families,”Mathematical Programming 29 (1984) 125–141.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Naitoh, T., Fujishige, S. A note on the Frank—Tardos bi-truncation algorithm for crossing-submodular functions. Mathematical Programming 53, 361–363 (1992). https://doi.org/10.1007/BF01585712
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585712