Skip to main content
SpringerLink
Log in

Estimation of the number of iterations in integer programming algorithms using the regular partitions method

  • Published:
Russian Mathematics Aims and scope Submit manuscript

Abstract

We review the results of studying integer linear programming algorithms which exploit properties of problem relaxation sets. The main attention is paid to the estimation of the number of iterations of these algorithms by means of the regular partitions method and other approaches. We present such estimates for some cutting plane, branch and bound (Land and Doig scheme), and L-class enumeration algorithms and consider questions of their stability. We establish the upper bounds for the average number of iterations of the mentioned algorithms as applied to the knapsack problem and the set packing one.

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. I. V. Sergienko, Mathematical Models and Solution Methods of Discrete Optimization Problems (Naukova Dumka, Kiev, 1988).

    Google Scholar 

  2. A. Schrijver Theory of Linear and Integer Programming (Wiley, 1986; Mir, Moscow, 1991), Vol. 2.

    MATH  Google Scholar 

  3. V. N. Shevchenko, Qualitative Questions of Integer Programming (Fizmatlit, Moscow, 1995).

    Google Scholar 

  4. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization (A Wiley-Interscience Publication: John Wiley & Sons, Inc., 1999).

    MATH  Google Scholar 

  5. A. A. Kolokolov, “Application of Regular Partitions in Integer Programming”, Izv. Vyssh. Uchebn. Zaved. Mat., No. 12, 11–30 (1993) [Russian Mathematics (Iz. VUZ) 54 (7), 37–48 (2010)].

    Google Scholar 

  6. A. A. Kolokolov, “Regular Partitions and Cuttings in Integer Programming,” Sib. Zhurn. Issledovaniya Operatsii 1(2), 18–39 (1994).

    MATH  MathSciNet  Google Scholar 

  7. A. A. Kolokolov, “About the Number of Cutting Planes in the First Gomory Algorithm,” in Problems of Analysis of Discrete Information (Novosibirsk, 1975), Part 1, pp. 84–96.

    Google Scholar 

  8. A. A. Kolokolov, “About the Lexicographic Structure of Some Convex Polyhedral Sets,” in Proceedings of 5th All-Russian Conference on Problems of Theoretical Cybernetics (Novosibirsk, 1980), pp. 77–79.

    Google Scholar 

  9. A. A. Kolokolov, “Regular Cuttings with Solution to Integer Optimization Problems,” Upravlyaemye Sistemy 21, 18–25 (1981).

    MATH  MathSciNet  Google Scholar 

  10. M. V. Devyaterikova, A. A. Kolokolov, and A. P. Kolosov, “Investigation of Some Integer Programming Algorithms Using L-partitions and Unimodular Transformation,” Preprint (OmGU, Omsk, 2009).

    Google Scholar 

  11. L. A. Saiko, “Investigation of Power of L-coverings for Some Cover Problems,” in Discrete Optimization and Analysis of Complex Systems (Novosibirsk, VTs SO AN SSSR, 1989), pp. 76–97.

    Google Scholar 

  12. R. G. Jeroslow, “Trivial Integer Programs Unsolvable by Branch-and-bound,” Math. Program. 6(1), 105–109 (1974).

    Article  MATH  Google Scholar 

  13. A. A. Kolokolov, M. V. Devyaterikova, and L. A. Zaozerskaya, Regular Partitions in Integer Programming, Textbook (OmGU, Omsk, 2007).

    Google Scholar 

  14. A. A. Kolokolov and E. V. Tsepkova, “Investigation of Knapsack Problem on the Base of L-partition,” Kibernetika, No. 2, 38–43 (1991).

    Google Scholar 

  15. A. A. Kolokolov, “On the L-structure of Integer Linear Programming Problems,” Lect. Notes in Control and Inform. Sci. Syst. Modelling and Optimization 197, 756–761 (1994).

    MathSciNet  Google Scholar 

  16. A. A. Kolokolov, “About the Length of Lexicographically Monotone Sequences,” in Optimization of Territorial and Branch Systems, Solution Methods for Economic Problems (Novosibirsk, 1973), Part III, pp. 93–99.

    Google Scholar 

  17. F. J. Nourie and E. R. Venta, “An Upper Bound on the Number of Cuts Needed in Gomory’s Method of Integer Forms,” Oper. Res. Letters 1(4), 129–133 (1981/82).

    Article  MathSciNet  Google Scholar 

  18. O. A. Zablotskaya and A. A. Kolokolov, “Completely Regular Cuttings in Boolean Programming,” Upravlyaemye Sistemy 23, 55–63 (1983).

    MATH  MathSciNet  Google Scholar 

  19. R. Yu. Simanchev, “About Completely Regular Cuttings in Integer Optimization Problems,” Upravlyaemye Sistemy 30, 61–71 (1990).

    MATH  MathSciNet  Google Scholar 

  20. A. A. Korbut and Yu. Yu. Finkel’shtein, Discrete Programming (Nauka, Moscow, 1969).

    Google Scholar 

  21. L. A. Saiko, “Investigation of a Class of Partitions in Integer Programming,” Upravlyaemye Sistemy 29, 72–82 (1989).

    MathSciNet  Google Scholar 

  22. Yu. Yu. Finkel’shtein, Approximate Methods and Applied Problems of Discrete Programming (Nauka, Moscow, 1976).

    Google Scholar 

  23. R. M. Kolpakov and M. A. Posypkin, “Asymptotic Complexity Estimate of the Branch-and-bound Method with Branching with Respect to Fractional Variable for the Knapsack Problem,” Diskretnyi Analiz i Issledovanie Operatsii 15(1), 58–81 (2008).

    MATH  MathSciNet  Google Scholar 

  24. A. V. Eremeev, L. A. Zaozerskaya, and A. A. Kolokolov, “The Problem about the Set Cover: Complexity, Algorithms, Experimental Investigations,” Diskretnyi Analiz i Issledovanie Operatsii. Ser. 2 7(2), 22–46 (2000).

    MATH  MathSciNet  Google Scholar 

  25. A. A. Kolokolov, A. V. Adel’shin, and D. I. Yagofarova, “The Solution of Satisfiability Problem Using the Method of Enumeration of L-classes,” Inform. Tekhnologii, No. 2, 54–59 (2009).

    Google Scholar 

  26. A. A. Kolokolov, T. G. Orlovskaya, and M. F. Rybalka, “The Analysis of Integer Programming Algorithms Using L-partitions and Unimodular Transformations,” Avtomatika i Telemekhanika,No. 2, 178–190 (2012).

    Google Scholar 

  27. R. Jeroslow and K. Kortanek, “On an Algorithm of Gomory,” SIAM J. Appl. Math. 21(1), 55–60 (1971).

    Article  MATH  MathSciNet  Google Scholar 

  28. A. Kolokolov and N. Kosarev, “Analysis of Decomposition Algorithms with Benders Cuts for p-Median Problem,” J. Math. Modelling and Algorithms 5(2), 189–199 (2006).

    Article  MATH  MathSciNet  Google Scholar 

  29. L. A. Zaozerskaya, “Analysis of Fractional Covering of Some Supply Management Problems,” J. Math. Modelling and Algorithms 5(2), 201–213 (2006).

    Article  MATH  MathSciNet  Google Scholar 

  30. L. A. Saiko, “About the Number of Iterations of Direct Cutting-Plane Algorithms,” in Discrete Optimization and Numeric Solution Methods for Applied Problems (Novosibirsk, VTs SO AN SSSR, 1986), pp. 86–88.

    Google Scholar 

  31. A. A. Kolokolov, “On an Estimate of Iterations Number for Direct Cutting Plane Algorithms in Integer Linear Programming,” in Mathematical Analysis of Economic Models (Novosibirsk, IEiOPP SO AN SSSR, 1971), Part I, pp. 137–164.

    Google Scholar 

  32. S. I. Mathis Jr., “A Counterexample to the Rudimentary Primal Integer Programming Algorithm,” Oper.Res. 19(6), 1518–1522 (1971).

    Article  MATH  Google Scholar 

  33. M. V. Devyaterikova and A. A. Kolokolov, “Stability of Some Integer Programming Algorithms,” Izv. Vyssh. Uchebn. Zaved. Mat., No. 12, 41–48 (2003) [Russian Mathematics (Iz. VUZ) 47 (12), 38–45 (2003)].

    Google Scholar 

  34. M. V. Devyaterikova and A. A. Kolokolov, “The Analysis of Stability of Some Discrete Optimization Algorithms,” Avtomatika i Telemekhanika, No. 3, 48–54 (2004).

    Google Scholar 

  35. M. V. Devyaterikova and A. A. Kolokolov, “On the Stability of Some Integer Programming Algorithms,” Oper. Res Letters 34(2), 149–154 (2006).

    Article  MathSciNet  Google Scholar 

  36. I. V. Sergienko, L. N. Kozeratskaya, and T. T. Lebedeva, The Investigation of Stability and the Parametric Analysis of Discrete Optimization Problems (Naukova Dumka, Kiev, 1995).

    Google Scholar 

  37. E. N. Gordeev and V. K. Leont’ev, “A General Approach to the Study of the Stability of Solutions in Discrete Optimization Problems,” Zhurn. Vychisl. Matem. I Mat. Fiziki 36(1), 66–72 (1996).

    MathSciNet  Google Scholar 

  38. V. A. Emelichev and D. P. Podkopaev, “On a Quantitative Measure of Stability for a Vector Problem in Integer Programming,” Zhurn. Vychisl. Matem. i Mat. Fiziki 38(11), 1801–1805 (1998).

    MathSciNet  Google Scholar 

  39. L. A. Zaozerskaya and A. A. Kolokolov, “About an Average Number of Iterations of Some Solution Algorithms for Problem about a Set Packing,” in Proceedings of XIV Baikal International Workshop ‘Optimization Methods and their Applications,’ Irkutsk, Baikal, July 2–8, 2008 (Irkutsk, ISEM SO RAN), Vol. 1, pp. 388–395.

  40. L. A. Zaozerskaya and A. A. Kolokolov, “About an Average Number of Iterations for Some Algorithms of Solution to the Problemabout a Set Packing,” Zhurn. Vychisl. Matem. I Mat. Fiziki 50(2), 242–248 (2010).

    MATH  MathSciNet  Google Scholar 

  41. L. A. Zaozerskaya, A. A. Kolokolov, and N. G. Gofman, “Bounds on Average Number of Iterations of the Algorithms for Solving Some Boolean Programming Problems,” Diskretnyi Analiz i Issledovanie Operatsii 18(3), 49–64 (2011).

    MATH  MathSciNet  Google Scholar 

  42. A. A. Kolokolov and L. A. Zaozerskaya, “On Average Number of Iterations of Some Algorithms for Solving the Set Packing,” in Preprints of 13th IFAC Symposium on Inform. Control Probl. in Manufacturing (INCOM’09), June 3–5, Moscow, Russia I, 1493–1496 (2009).

    Google Scholar 

  43. N. N. Kuzyurin, “An Polynomial on the Average Algorithm in Integer Linear Programming,” Sib. Zhurn. Issledovaniya Operatsii 1(3), 38–48 (1994).

    MATH  MathSciNet  Google Scholar 

  44. N. N. Kuzyurin and S. A. Fomin, “Efficient Algorithms and Complexity of Computations,” http://discopal.ispras.ru/ru.book-advanced-algorithms.htm.

  45. L. A. Zaozerskaya and A. A. Kolokolov, “Estimates of the Average Number of Iterations for Some Algorithms of Solution to the Knapsack Problem,” in Proceedings of the V III International Conference ‘Discrete Models in Theory of Control Systems,’ Moscow, April 6–9, 2009 (Moscow, MAKS PRESS 2009), pp. 101–106.

    Google Scholar 

  46. A.A. Kolokolov and L.A. Zaozerskaya, “On the Approach of Obtaining the Upper Bounds on the Average Number of Iterations of Some Integer Programming Algorithms,” in Proceedings of II International Conference ‘Optimization and Applications’, Ed. by A. I. Golikov, Petrovac, Montenegro, September 25–October 2, 2011 (Moscow, VTs im. A. A. Dorodnitsyna RAN), pp. 137–140.

Download references

Author information

Authors and Affiliations

  1. Omsk State University, ul. Pevtsova 13, Omsk, 644043, Russia

    A. A. Kolokolov & L. A. Zaozerskaya

Authors
  1. A. A. Kolokolov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. A. Zaozerskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. A. Kolokolov.

Additional information

Original Russian Text © A.A. Kolokolov and L.A. Zaozerskaya, 2014, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2014, No. 1, pp. 31–40.

About this article

Cite this article

Kolokolov, A.A., Zaozerskaya, L.A. Estimation of the number of iterations in integer programming algorithms using the regular partitions method. Russ Math. 58, 35–46 (2014). https://doi.org/10.3103/S1066369X14010046

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X14010046

Keywords and phrases

Search

Navigation