On the L-structure of integer linear programming problems

  • Alexander A. Kolokolov
Contributed Papers Discrete Optimization
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 197)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kolokolov A.A. Regular cuts by solving of the integer optimization problems. In: Controllable systems. Novosibirsk, 1981, N21, p. 18–25.Google Scholar
  2. 2.
    Kolokolov A.A. A study of integer programming problems and methods on the base of L-partition. 33 Inter. Wiss. Koll. TH Ilmenau, 1988, 53–55.Google Scholar
  3. 3.
    Kolokolov A.A., Tcepkova E.V. A study of the knapsack problem on the base of L-partition. Cybernetics, 1991, N2, p. 38–43.Google Scholar
  4. 4.
    Kolokolov A.A. Regular partitions in integer programming. In: Methods of solving and analysis for the discrete optimization problems. Omsk, OmGU, 1992, p. 67–93.Google Scholar
  5. 5.
    Kolokolov A.A. Upper bound of L-covering power in the boolean programming problems. III international seminar on global optimization. Irkutsk, 1992, p. 108.Google Scholar
  6. 6.
    Kolokolov A.A. Regular partitions and branch and bound method. Conference "Mathematical programming and applications", Ekaterinburg, 1993, p. 61.Google Scholar
  7. 7.
    Zablotcskaja O.A., Kolokolov A.A. Fully regular cuts in boolean programming. In: Controllable systems. Novosibirsk, 1983, N23, p. 55–63.Google Scholar
  8. 8.
    Zabudsky G.G. On an integer programming formulation of the facilities layout problem on the line. In: Controllable systems, Novosibirsk, 1990, N30, p. 35–45.Google Scholar

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Alexander A. Kolokolov
    • 1
  1. 1.Institute of Information Technologies and Applied MathematicsRussian Academy of SciencesOmskRussia

Personalised recommendations