Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- 13 August 2008
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 122 (1) , 87-120
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- Decomposition of a bidirected graph into strongly connected components and its signed poset structureDiscrete Applied Mathematics, 1996
- A characterization of bisubmodular functionsDiscrete Mathematics, 1996
- Delta-Matroids, Jump Systems, and Bisubmodular PolyhedraSIAM Journal on Discrete Mathematics, 1995
- A separation algorithm for the matchable set polytopeMathematical Programming, 1994
- b-matching degree-sequence polyhedraCombinatorica, 1991
- Matchings and ▵-matroidsDiscrete Applied Mathematics, 1989
- PseudomatroidsDiscrete Mathematics, 1988
- Some combinatorial properties of discriminants in metric vector spacesAdvances in Mathematics, 1986
- The Partial Order of a Polymatroid Extreme PointMathematics of Operations Research, 1985
- Lattice Theory. By Garrett Birkhoff. 2nd edition. Pp. xiii, 283. $6. 1948. American Mathematical Society Colloquium Publications, 25. (American Mathematical Society, New York)The Mathematical Gazette, 1950