Skip to main content
SpringerLink
Log in

Using dual network bounds in algorithms for solving generalized set packing partitioning problems

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

This article deals with a method to compute bounds in algorithms for solving the generalized set packing/partitioning problems. The problems under investigation can be solved by the branch and bound method. Linear bounds computed by the simplex method are usually used. It is well known that this method breaks down on some occasions because the corresponding linear programming problems are degenerate. However, it is possible to use the dual (Lagrange) bounds instead of the linear bounds. A partial realization of this approach is described that uses a network relaxation of the initial problem. The possibilities for using the dual network bounds in the approximation techniques to solve the problems under investigation are described.

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. E. Balas and M.W. Padberg, “Set partitioning: A survey,” SIAM Rev., vol. 18, pp. 710–760, 1976.

    Google Scholar 

  2. A.M. Geoffrion, “Elements of large-scale mathematical programming,” Management Sci., vol. 16, pp. 652–691, 1970.

    Google Scholar 

  3. R.M. Karp, “On the computational complexity of combinatorial problems,” Networks, vol. 5, pp. 45–68, 1975.

    Google Scholar 

  4. A. Kaufmann and A. Henri-Laborder, Methods, and Models of Operation Research, Mir: Moscow, 1977 (in Russian).

  5. R.E. Marsten, “An algorithm for large set partitioning problems,” Management Sci., vol. 20, pp. 774–787, 1974.

    Google Scholar 

  6. G.L. Nemhauser and G.M. Weber, “Optimal set partitioning, matchings and Lagrangian duality,” Nav. Res. Q., vol. 26, pp. 553–563, 1979.

    Google Scholar 

  7. A. Pnueli, A. Lembel, and S. Even “Transitive orientation of graph and identification of permutation graph,” Can. J. Math., vol. 23, pp. 160–175, 1971.

    Google Scholar 

  8. N.Z. Shor, Minimization Methods for Non-Differentiable Functions, Springer-Verlag: Berlin, 1985.

    Google Scholar 

  9. N.Z. Shor and S.I. Stetsenko, Quadratic Extremal Problems and Nondifferentiable Optimization, Naukova Dumka: Kiev, 1989 (in Russian).

    Google Scholar 

  10. Yu. V. Voitishin “Algorithms to find the maximum set of pairwise incomparable weighted vertices in a directed acyclic graph,” Cybernet. Syst. Anal., vol. 27, pp. 475–480, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for cybernetics, Ukrainian Academy of Sciences, 252207, Kiev, The Ukraine

    N. Z. Shor, Yu. V. Voitishin & V. M. Glushkov

Authors
  1. N. Z. Shor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu. V. Voitishin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. M. Glushkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shor, N.Z., Voitishin, Y.V. & Glushkov, V.M. Using dual network bounds in algorithms for solving generalized set packing partitioning problems. Comput Optim Applic 6, 293–303 (1996). https://doi.org/10.1007/BF00247796

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00247796

Keywords

Search

Navigation