A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions

A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions

0.00 Avg rating—0 Votes
Article ID: iaor1993309
Country: Netherlands
Volume: 53
Issue: 3
Start Page Number: 361
End Page Number: 363
Publication Date: Feb 1992
Journal: Mathematical Programming (Series A)
Authors: ,
Abstract:

Recently, Frank and Tardos presented an algorithm, called the bi-truncation algorithm, for discerning whether a polyhedron defined by Q(b“)={x•x∈ℝS,ℝX⊆S:x(X)∈b”(X),x(S)=b“(S)∈ is nonempty, where b” is a crossing-submodular function on 2S. The authors point out an error in their algorithm and show how it is corrected.

Reviews

Required fields are marked *. Your email address will not be published.