Skip to main content
SpringerLink
Log in

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

  • FULL LENGTH PAPER
  • Series A
  • Published:
Mathematical Programming Submit manuscript

Abstract

Bisubmodular functions are a natural “directed”, or “signed”, extension of submodular functions with several applications. Recently Fujishige and Iwata showed how to extend the Iwata, Fleischer, and Fujishige (IFF) algorithm for submodular function minimization (SFM) to bisubmodular function minimization (BSFM). However, they were able to extend only the weakly polynomial version of IFF to BSFM. Here we investigate the difficulty that prevented them from also extending the strongly polynomial version of IFF to BSFM, and we show a way around the difficulty. This new method gives a somewhat simpler strongly polynomial SFM algorithm, as well as the first combinatorial strongly polynomial algorithm for BSFM. This further leads to extending Iwata’s fully combinatorial version of IFF to BSFM.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ando, K., Fujishige, S.: \({\sqcup}\) , \({\sqcap}\) -closed families and signed posets. Report no. 93813, Forschungsinstitut für Diskrete Mathematik, Universität Bonn (1994)

  2. Ando K., Fujishige S.: On structures of bisubmodular polyhedra. Math. Prog. 74, 293–317 (1996)

    MathSciNet  Google Scholar 

  3. Ando K., Fujishige S., Naitoh T.: A characterization of bisubmodular functions. Discrete Math. 148, 299–303 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ando K., Fujishige S., Nemoto T.: The minimum-weight ideal problem for signed posets. J. OR Soc. Jpn. 39, 558–565 (1996)

    MATH  MathSciNet  Google Scholar 

  5. Ando K., Fujishige S., Nemoto T.: Decomposition of a bidirected graph into strongly connected components and its signed poset structure. Disc. Appl. Math. 68, 237–248 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  6. Applegate D.L., Bixby R.E., Chvátal V., Cook W.J.: The traveling salesman problem: a computational study. Princeton University Press, Princeton (2007)

    Google Scholar 

  7. Bilbao Arrese, J.M., Fernández García, J.R., Jiménez Jiménez, M., López Vázquez, J.J.: A survey of bicooperative games. In: Proceedings of the 4th Twente Workshop on Cooperative Game Theory, Enschede, the Netherlands, pp. 5–15 (2005)

  8. Birkhoff, G.: Lattice Theory. American Mathematical Society (1967)

  9. Bixby R.E., Cunningham W.H., Topkis D.M.: The partial order of a polymatroid extreme point. Math. OR 10, 367–378 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  10. Bouchet A.: Matchings and Δ-matroids. Discrete Math. 24, 55–62 (1989)

    MATH  MathSciNet  Google Scholar 

  11. Bouchet A., Cunningham W.H.: Delta-matroids, jump systems and bisubmodular polyhedra. SIAM J. Disc. Math. 8, 17–32 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Chandrasekaran R., Kabadi S.N.: Pseudomatroids. Disc. Math. 71, 205–217 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  13. Cunningham W.H.: Testing membership in matroid polyhedra. JCT Ser. B 36, 161–188 (1984)

    MATH  MathSciNet  Google Scholar 

  14. Cunningham W.H., Green-Krótki J.: b-matching degree sequence polyhedra. Combinatorica 11, 219–230 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  15. Cunningham W.H., Green-Krótki J.: A separation algorithm for the matchable set polytope. Math. Prog. 65, 139–150 (1994)

    Article  Google Scholar 

  16. Dress A., Havel T.F.: Some combinatorial properties of discriminants in metric vector spaces. Adv. Math. 62, 285–312 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  17. Dunstan F.D.J., Welsh D.J.A.: A greedy algorithm for solving a certain class of linear programmes. Math. Prog. 62, 338–353 (1973)

    Article  MathSciNet  Google Scholar 

  18. Fleischer, L.K., Iwata, S.: A push-relabel framework for submodular function minimization and applications to parametric optimization. “Submodularity” special issue of Discrete Applied Mathematics. In: Fujishige S. (ed.) 131, 311–322 (2003)

  19. Fujishige S.: A system of linear inequalities with a submodular function on {0,  ±  1}-vectors. Lin. Alg. Appl. 63, 253–266 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  20. Fujishige S.: A min-max theorem for bisubmodular polyhedra. SIAM J. Disc. Math. 10, 294–308 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  21. Fujishige S.: Submodular function minimization and related topics. Optim. Methods Softw. 18, 169–180 (2003)

    Article  Google Scholar 

  22. Fujishige S.: Submodular Functions and Optimization, 2nd edn. Elsevier, Amsterdam (2005)

    MATH  Google Scholar 

  23. Fujishige, S., Hayashi, T., Isotani, S.: The minimum-norm-point algorithm applied to submodular function minimization and linear programming. Research Institute for Mathematical Sciences, RIMS-1571, Kyoto University, Kyoto (2006, Preprint)

  24. Fujishige, S., Iwata, S.: Bisubmodular function minimization. SIAM J. Disc. Math. 19, pp. 1065–1073; an earlier version appeared in Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization (IPCO Utrecht 2001), Lecture Notes in Computer Science 2081, Aardal, K., Gerards, B. (eds.) Springer, Berlin, 160–169 (2006)

  25. Goldberg A.V., Karzanov A.V.: Maximum skew-symmetric flows and matchings. Math. Program. 100, 537–568 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  26. Goldberg A.V., Tarjan R.E.: Finding minimum-cost circulations by successive approximation. Math. Oper. Res. 15, 430–466 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  27. Grötschel M., Lovász L., Schrijver A.: The ellipsoid algorithm and its consequences in combinatorial optimization. Combinatorica 1, 499–513 (1981)

    Article  Google Scholar 

  28. Grötschel M., Lovász L., Schrijver A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)

    MATH  Google Scholar 

  29. Hochbaum, D.S.: Polynomial and strongly polynomial algorithms for convex network optimization. In: Du, D.Z., Pardalos, P.M. (eds.) Network Optimization Problems, pp. 63–92 (1993)

  30. Iwata S.: A fully combinatorial algorithm for submodular function minimization. J. Combin. Theory Ser. B 84, 203–212 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  31. Iwata, S.: A faster scaling algorithm for minimizing submodular functions. SIAM J. Comput. 32, 833–840; an extended abstract appeared In Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization (IPCO MIT), Lecture Notes in Computer Science 2337 (Cook, W.J., Schulz, A.S. (eds.)), Springer, Berlin, pp. 1–8 (2003)

  32. Iwata S.: Submodular function minimization. Math. Program. 112, 45–64 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  33. Iwata S., Fleischer L., Fujishige S.: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. J. ACM 48, 761–777 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  34. Kabadi, S.N.: Characterization and development of solution methods for special classes of totally dual integral systems. Dissertation, School of Management, University of Texas at Dallas (1984)

  35. Kabadi S.N., Chandrasekaran R.: On totally dual integral systems. Disc. Appl. Math. 26, 87–104 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  36. McCormick S.T.: Submodular function minimization. In: Aardal, K., Nemhauser, G., Weismantel, R.(eds) A chapter in the Handbook on Discrete Optimization., Elsevier, Amsterdam (2006)

    Google Scholar 

  37. Megiddo N.: Combinatorial optimization with rational objective functions. Math. Oper. Res. 4, 414–424 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  38. Murota K.: Discrete Convex Analysis. SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, Philadelphia (2003)

    MATH  Google Scholar 

  39. Nagano K.: A strongly polynomial algorithm for line search in submodular polyhedra. Disc. Optim. 4, 349–359 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  40. Nagano, K.: On convex minimization over base polytopes. In: Fischetti, M., Williamson, D. (eds.) Proceedings of IPCO 12. Ithaca, pp. 252–266 (2007)

  41. Nakamura M.: A characterization of greedy sets—universal polymatroids I. Scientific Papers of the College of Arts and Sciences, The University of Tokyo 38, 155–167 (1988)

    Google Scholar 

  42. Orlin, J.B.: A faster strongly polynomial algorithm for submodular function minimization. Math. Prog. In: Proceedings of IPCO 12, Fischetti, M., Williamson, D. (eds.) Ithaca, pp. 240–251 (2007, To appear)

  43. Qi L.: Directed submodularity, ditroids, and directed submodular flows. Math. Prog. 42, 579–599 (1988)

    Article  MATH  Google Scholar 

  44. Queyranne M.N., Wang Y.: Single-machine scheduling polyhedra with precedence constraints. Math. OR 16, 1–20 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  45. Reiner V.: Signed posets. J. Comb. Theory A 62, 324–360 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  46. Schrijver A.: Proving total dual integrality with cross-free families—a general framework. Math. Program. 29, 15–27 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  47. Shrijver A.: Theory of Linear and Integer Programming. Wiley, New York (1986)

    Google Scholar 

  48. Schrijver A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combin. Theory Ser. B 80, 346–355 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  49. Schrijver A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)

    MATH  Google Scholar 

  50. Tardos É.: A strongly polynomial minimum cost circulation algorithm. Combinatorica 5, 247–256 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  51. Vygen J.: A note on Schrijver’s submodular function minimization algorithm. JCT B 88, 399–402 (2003)

    MATH  MathSciNet  Google Scholar 

  52. Zhang F.: A separation algorithm for b-matching degree-sequence polyhedra. Math. Oper. Res. 28, 92–102 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sauder School of Business, University of British Columbia, Vancouver, BC, V6T 1Z2, Canada

    S. Thomas McCormick

  2. Research Institute for Mathematical Sciences, Kyoto University, Kyoto, 606-8502, Japan

    Satoru Fujishige

Authors
  1. S. Thomas McCormick
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Satoru Fujishige
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Thomas McCormick.

Additional information

The research of S. T. McCormick was supported by an NSERC Operating Grant.

The research of S. Fujishige was supported by a Grant-in-Aid of the Ministry of Education, Culture, Science and Technology of Japan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

McCormick, S.T., Fujishige, S. Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. Math. Program. 122, 87–120 (2010). https://doi.org/10.1007/s10107-008-0242-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-008-0242-9

Mathematics Subject Classification (2000)

Search

Navigation