Skip to main content
Log in

Monotone Diameter of Bisubmodular Polyhedra

  • Research
  • Published:
Operations Research Forum Aims and scope Submit manuscript

Abstract

Finding sharp bounds on the diameter of polyhedra is a fundamental problem in discrete mathematics and computational geometry. In particular, the monotone diameter and height play an important role in determining the number of iterations by operating the pivot rule of the simplex method for linear programming. In this study, for a d-dimensional polytope defined by at most \(3^{d} -1\) linear inequality induced by functions called bisubmodular, we prove that the diameter, monotone diameter, and height are coincide, and the tight upper bound is \({d}^2\).

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Data Availability

Data sharing does not apply to this article as no datasets were generated or analyzed during the current study.

Code Availability

It does not apply to this article as no code is used in this study.

Notes

  1. We do not differentiate pivot rules for simplicity. It is clear that the height is the upper bound for any pivot rules.

  2. These conditions are to exclude the trivial case, where (9) apparently are satisfied since equalities \(\{(X_1,Y_1)\sqcup (X_2,Y_2),(X_1,Y_1)\sqcap (X_2,Y_2)\} = \{(X_1,Y_1), (X_2,Y_2) \}\).

  3. A special case, strict bisubmodular only, was briefly mentioned in [32].

  4. See also Theorem 8 and inequality (1).

References

  1. Kalai G (1922) Upper bounds for the diameter and height of graphs of convex polyhedra. Discrete Comput Geom 8:363–372

    Article  MathSciNet  Google Scholar 

  2. Kalai G, Kleitman DJ (1992) A quasi-polynomial bound for the diameter of graphs of polyhedra. Bulletin of AMS 26:315–316

    Article  MathSciNet  Google Scholar 

  3. Pak I (2000) Four questions on Birkhoff polytope. Annals of Combin 4(1):83–90

    Article  MathSciNet  Google Scholar 

  4. Gritzmann P, Sturmfels B (1993) Minkowski addition of polytopes: computation complexity and applications to Gröbner bases. SIAM J Discrete Math 6(2):246–269

    Article  MathSciNet  Google Scholar 

  5. Naddef D (1998) The Hirsch conjecture is true for (0,1)-polytopes. Math Program 45:109–110

    Article  MathSciNet  Google Scholar 

  6. Todd M (2014) An improved Kalai-Kleitman bound for the diameter of a polyhedron. SIAM J Discrete Math 28:1944–1947

    Article  MathSciNet  Google Scholar 

  7. Kuno T, Sano Y, Tsuruda T (2018) Computing Kitahara-Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm. Optim Lett 12(5):933–943

    Article  MathSciNet  Google Scholar 

  8. Pfeifle J, Ziegler GM (2004) On the monotone upper bound problem. Experimental Math 13(1):1–11

    Article  MathSciNet  Google Scholar 

  9. Kalai G (2017) 19 Polytope skeletons and paths. In: Handbook of Discrete and Computational Geometry 3rd edn by Csaba D. Toth, Joseph O’Rourke, Jacob E. Goodman, Chapman and Hall, New York

  10. Grünbaum B (2002) Convex polytopes, 2nd edn. Springer

    Google Scholar 

  11. Todd M (1980) The monotonic bounded Hirsch conjecture is false for dimension at least 4. Math Oper Res 5(4):599–601

    Article  MathSciNet  Google Scholar 

  12. Sukegawa N (2019) An asymptotically improved upper bound on the diameter of polyhedra. Discrete Comput Geom 62:690–699

    Article  MathSciNet  Google Scholar 

  13. Borgwardt S, De Loera JA, Finhold E (2018) The diameters of network-flow polytopes satisfy the Hirsch conjecture. Math Program 171(1–2):283–309

    Article  MathSciNet  Google Scholar 

  14. Sanità L (2018) The diameter of the fractional matching polytope and its hardness implications. IEEE 59th FOCS:910-921

  15. Rispoli FJ (1998) The monotonic diameter of traveling salesman polytopes. Oper Res Lett 22:69–73

    Article  MathSciNet  Google Scholar 

  16. Rispoli FJ, Cosares S (1998) A bound of 4 for the diameter of the symmetric traveling salesman polytope. SIAM J Discrete Math 11:373–380

    Article  MathSciNet  Google Scholar 

  17. Padberg MW, Rao MR (1974) The travelling salesman problem and a class of polyhedra of diameter two. Math Program 7:32–45

    Article  MathSciNet  Google Scholar 

  18. Blanchard M, De Loera JA, Louveaux Q (2021) On the length of monotone paths in polyhedra. SIAM J Discrete Math 35(3):1746–1768

    Article  MathSciNet  Google Scholar 

  19. Adler I, Papadimitriou C, Rubinstein A (2014) On simplex pivoting rules and complexity theory. IPCO’14:13-24

  20. Kitahara T, Mizuno S (2013) A bound for the number of different basic solutions generated by the simplex method. Math Program 137:579–586

    Article  MathSciNet  Google Scholar 

  21. Edmonds J (2023) Submodular functions, matroids, and certain polyhedra. In: Reinelt Gerhard, Rinaldi Giovanni (eds) Michael Jünger. Springer, Combinatorial Optimization, pp 11–26

    Google Scholar 

  22. Fujishige S (2005) Submodular functions and optimization, vol 58, 2nd edn. Elsevier

  23. Ward J, Živný S (2014) Maximizing bisubmodular and k-submodular functions. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms:1468-1481

  24. Ando K, Fujishige S (2021) Signed ring families and signed posets. J Optim Methods Software 36(2–3):262–278

    Article  MathSciNet  Google Scholar 

  25. Bilmes1 JA, Bai1 W (2017) Deep submodular functions. https://arxiv.org/abs/1701.08939

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

    Article  MathSciNet  Google Scholar 

  27. Reiner V (1993) Signed posets. J Combin Theory Ser A 62:324–360

    Article  MathSciNet  Google Scholar 

  28. Fujishige S (2014) Bisubmodular polyhedra, simplicial divisions, and discrete convexity. Discrete Optim 12:115–120

    Article  MathSciNet  Google Scholar 

  29. Deza A, Pournin L, Sukegawa N (2020) The diameter of lattice zonotopes. Proc Am Math Soc 148(8):3507–3516

    Article  MathSciNet  Google Scholar 

  30. Topkis DM (1992) Paths on polymatroids. Math. Program 54:335–351

    Article  MathSciNet  Google Scholar 

  31. Alexandrino AO, Miranda GHS, Lintzmayer CN, Dias1 Z (2021) Length-weighted \(\lambda\)-rearrangement distance. J Combin Optim 41:579–602

  32. Zhan P (2005) Polyhedra and optimization related to a weak absolute majorization. J Oper Res Soc Japan 48:90–96

    MathSciNet  Google Scholar 

Download references

Acknowledgements

We are grateful to anonymous reviewers for their comments to improve the presentation of the present paper. We would like to thank RIMS, Kyoto University, for providing a chance of a presentation and a valuable discussion.

Funding

The first and third authors’ work were supported partially by JSPS KAKENHI Grant Number, 20K04973 and 20H05964, 20K04970, respectively.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ping Zhan.

Ethics declarations

Ethics Approval

Ethics do not apply to this article as no ethic issue is included in this study.

Consent to Participate

It does not apply to this article since no participation was involved in this study.

Consent for Publication

The authors declares consent to publication.

Conflict of Interest

The authors declares no competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Matsui, Y., Sukegawa, N. & Zhan, P. Monotone Diameter of Bisubmodular Polyhedra. Oper. Res. Forum 4, 76 (2023). https://doi.org/10.1007/s43069-023-00260-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s43069-023-00260-1

Keywords

Navigation