Skip to main content
SpringerLink
Log in

Analysis of Fractional Covering of Some Supply Management Problems

  • Published:
Journal of Mathematical Modelling and Algorithms

Abstract

We study a supply management problem with a linear cost function and its mixed integer program. A parametric family of such problems, possessing exponential L k -coverings, is constructed. Besides, the NP-hard expansion of the family, which has the same property, is formulated.

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. Chauhan, S. S., Eremeev, A. V., Kolokolov, A. A. and Servakh, V. V.: Concave cost supply management problem for single manufacturing unit, in A. Dolgui, J. Soldek and O. Zaikin (eds), Supply Chain Optimisation. Product/Process Design, Facility Location and Flow Control Series: Applied Optimization, 94, Springer, Berlin Heidelberg New York, 2005, pp. 167–174.

    Google Scholar 

  2. Chauhan, S. S., Eremeev, A. V., Romanova, A. A., Servakh, V. V. and Woeginger, G. J.: Approximation of the supply scheduling problem, Oper. Res. Lett. 33 (2005), 249–254.

    Article  MATH  MathSciNet  Google Scholar 

  3. Chauhan, S. S. and Proth, J.-M. The concave cost supply problem, Eur. J. Oper. Res. 148(2) (2003), 374–383.

    Article  MATH  MathSciNet  Google Scholar 

  4. Eremeev, A. V., Kolokolov, A. A. and Zaozerskaya, L. A.: A hybrid algorithm for set covering problem, in Proc. of International Workshop on Discrete Optimization Metods Design, Minsk, 2000, pp. 123–129.

  5. Kolokolov, A. A.: Regular cuts by solving integer optimization problems, Upravlyaemye Sistemy, Institute Math, SB AS USSR. 21 (1981), 18–25 (in Russian).

    MATH  MathSciNet  Google Scholar 

  6. Kolokolov, A. A.: Regular partitions and cuts in integer programming, Discr. Analysis and Oper. Res., Kluwer, Netherlands, 1996, pp. 59–79.

    Google Scholar 

  7. Kolokolov, A. A.: Regular partitions in integer programming problems, Methods to solving and analysis for discrete optimization problems, University of Omsk, 1992, pp. 67–93 (in Russian).

  8. Kolokolov, A. A.: Some L-class enumeration algorithms for integer programming problems. Proceedings of the of 3rd IFIP WG-7.6 Working Conference on Optimization – Based Computer – Aided Modelling and Design. Published by IITA, Prague, Czech. Republic, 256–260, 1995.

  9. Kolokolov, A. A. and Devyaterikova, M. V.: Analysis of L-structure stability of convex integer programming problems, Operations research proceedings, Springer, Berlin Heidelberg New York, 2000, pp. 49–54.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Omsk Branch of Sobolev Institute of Mathematics of Siberian Branch of Russian Academy of Sciences, 13, Pevtsov St., 644099, Omsk, Russia

    Lidia A. Zaozerskaya

Authors
  1. Lidia A. Zaozerskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lidia A. Zaozerskaya.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zaozerskaya, L.A. Analysis of Fractional Covering of Some Supply Management Problems. J Math Model Algor 5, 201–213 (2006). https://doi.org/10.1007/s10852-005-9016-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-005-9016-z

Key words

Mathematics Subject Classification (2000)

Search

Navigation