Article ID: | iaor1998330 |
Country: | Netherlands |
Volume: | 74 |
Issue: | 3 |
Start Page Number: | 293 |
End Page Number: | 317 |
Publication Date: | Sep 1996 |
Journal: | Mathematical Programming |
Authors: | Fujishige Satoru, Ando Kazutoshi |
Keywords: | posets, greedy algorithms |
A bisubmodular polyhedron is defined in terms of a so-called bisubmodular function on a family of ordered pairs of disjoint subsets of a finite set. We examine the structures of bisubmodular polyhedra in terms of signed poset and exchangeability graph. We give a characterization of extreme points together with an O(