Skip to main content
SpringerLink
Log in

Polynomial bounding for NP-hard problems

  • Chapter
  • First Online:
Combinatorial Optimization

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 12))

  • 176 Accesses

Abstract

A polynomial bounded method is presented for computing bounds to the value of the optimum of a large class of NP-hard combinatorial optimization problems.

This paper is a complete and correct version of the work presented at IX International Symposium on Mathematical Programming, Budapest, August 1976.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P.M. Camerini and F. Maffioli, “Bounds for 3-matroid intersection problems”, Information Processing Letters 3 (1975) 81–83.

    Article  MATH  MathSciNet  Google Scholar 

  2. P.M. Camerini and F. Maffioli, “Heuristically guided algorithm for k-parity matroid problem”, Discrete Mathematics 21 (1978) 103–116.

    Article  MATH  MathSciNet  Google Scholar 

  3. N. Christofides, “Bounds for the traveling salesman problem”, Operations Research 20 (1972) 1044–1056.

    Article  MATH  MathSciNet  Google Scholar 

  4. N. Christofides, Graph theory: an algorithmic approach (Academic Press, New York, 1975) 380–381.

    MATH  Google Scholar 

  5. G.A. Croes, “A method for solving traveling salesman problems”, Operations Research 6 (1958) 791–812.

    Article  MathSciNet  Google Scholar 

  6. G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, “Solution of a large scale traveling salesman problem”, Operations Research 2 (1954) 393–410.

    Article  MathSciNet  Google Scholar 

  7. L.R. Ford and D.R. Fulkerson, Flows in networks (Princeton Univ. Press, Princeton, NJ, 1962) pp. 93–111.

    MATH  Google Scholar 

  8. M. Held and R.M. Karp, “A dynamic programming approach to sequencing problems”, Journal of SIAM 10 (1962) 196–210.

    MATH  MathSciNet  Google Scholar 

  9. R.M. Karp, “On the computational complexity of combinatorial problems”, Networks 5 (1975) 45–68.

    MATH  MathSciNet  Google Scholar 

  10. E.L. Lawler, “Polynomial bounded and (apparently) non-polynomial bounded matroid computations”, in: R. Rustin, ed., Combinatorial algorithms (Algorithmic Press, 1973) pp. 49–57.

    Google Scholar 

  11. F. Maffioli, “Subgradient optimization, matroid problems and heuristic evaluation”, in: Optimization techniques, Proceedings 7th IFIP Conference Part 2 (Springer-Verlag, Berlin, 1976) pp. 389–396.

    Google Scholar 

  12. P. Wolfe, M. Held and H.P. Crowder, “Validation of subgradient optimization”, Mathematical Programming 6 (1974) 62–88.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Politecnico di Milano, Milano, Italy

    P. M. Camerini & F. Maffioli

Authors
  1. P. M. Camerini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Maffioli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. W. Padberg

Rights and permissions

Reprints and permissions

Copyright information

© 1980 The Mathematical Programming Society

About this chapter

Cite this chapter

Camerini, P.M., Maffioli, F. (1980). Polynomial bounding for NP-hard problems. In: Padberg, M.W. (eds) Combinatorial Optimization. Mathematical Programming Studies, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120890

Download citation

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

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00801-6

  • Online ISBN: 978-3-642-00802-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation