Skip to main content
SpringerLink
Log in

Direct cut-off method for combinatorial optimization problems with additional constraints

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A direct cut-off method to solve combinatorial optimization problems on polyarrangements with additional constraints is proposed and justified. The method allows obtaining a feasible solution at each stage without constructing the linear hull of the set of polyarrangements.

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 and M. F. Kaspshitskaya, Models and Methods for the Computer Solution of Combinatorial Optimization Problems [in Russian], Naukova Dumka, Kyiv (1981).

    Google Scholar 

  2. Yu. G. Stoyan and O. O. Iemets, Theory and Methods of Euclidean Combinatorial Optimization [in Ukrainian], ISDO, Kyiv (1993) (http://informatics.org.ua/uploads/books/stoyan_emets_eko.pdf).

  3. Yu. G. Stoyan, O. O. Iemets, and Ye. M. Yemets, Optimization on Polyarrangements: Theory and Methods [in Ukrainian], RVTs PUSKU, Poltava (2005).

  4. Yu. G. Stoyan, O. O. Iemets, and Ye. M. Yemets, “Sets of polyarrangements in combinatorial optimization,” Dop. NANU, No. 8, 37–41 (1999).

  5. O. O. Iemets and T. N. Barbolina, Combinatorial Optimization on Arrangements: A Monograph [in Russian], Naukova Dumka, Kyiv (2008).

    Google Scholar 

  6. O. O. Iemets and L. M. Kolechkina, Combinatorial Optimization Problems with Linear Fractional Objective Functions [in Ukrainian], Naukova Dumka, Kyiv (2005).

    Google Scholar 

  7. O. O. Iemets and O. V. Roskladka, Optimization Problems on Polycombinatorial Sets: Properties and Solution [in Ukrainian], RVTs PUSKU, Poltava (2006).

    Google Scholar 

  8. O. O. Emets’ and T. N. Barbolina, “On the solution of problems of nonlinear conditional optimization on arrangements by the cutoff method,” Ukr. Math. J., 55, No. 5, 729–738 (2003).

    Article  MathSciNet  Google Scholar 

  9. G. A. Donets and L. N. Kolechkina, “Method of ordering the values of a linear function on a set of permutations,” Cybern. Syst. Analysis, 45, No. 2, 204–213 (2009).

    Article  MathSciNet  Google Scholar 

  10. O. A. Emets and A. A. Roskladka, “On estimates of minima of criterion functions in optimization on combinations,” Ukr. Math. J., 51, No. 8, 1262–1265 (1999).

    Article  MathSciNet  Google Scholar 

  11. O. A. Emets and T. N. Barbolina, “Solving linear optimization problems on arrangements by the truncation method,” Cybern. Syst. Analysis, 39, No. 6, 889–896 (2003).

    Article  MathSciNet  MATH  Google Scholar 

  12. O. A. Yemets and T. N. Barbolina, “Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence,” Cybern. Syst. Analysis, 40, No. 5, 726–734 (2004).

    Article  Google Scholar 

  13. T. C. Hu, Integer Programming and Network Flows, Addison Wesley Longman Publ. Co. (1970).

  14. I. L. Akulich, Mathematical Programming in Examples and Problems: A Handbook for High-School Students in Economics [in Russian], Vyssh. Shk., Moscow (1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Poltava University of Economics and Trade, Poltava, Ukraine

    O. O. Iemets, Ye. M. Yemets & Yu. F. Oleksiichuk

Authors
  1. O. O. Iemets
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ye. M. Yemets
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yu. F. Oleksiichuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to O. O. Iemets.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 116–124, November–December 2011.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Iemets, O.O., Yemets, Y.M. & Oleksiichuk, Y.F. Direct cut-off method for combinatorial optimization problems with additional constraints. Cybern Syst Anal 47, 932–940 (2011). https://doi.org/10.1007/s10559-011-9372-9

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-011-9372-9

Keywords

Search

Navigation