Skip to main content
SpringerLink
Log in

Solution construction and greedy algorithms

  • Chapter
  • First Online:
Optimization by GRASP

Abstract

This chapter addresses the construction of feasible solutions. We begin by considering greedy algorithms and show their relationship with matroids. We then consider adaptive greedy algorithms, a generalization of greedy algorithms. Next, we present semi-greedy algorithms, obtained by randomizing adaptive greedy algorithms. The chapter concludes with a discussion of solution repair procedures.

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

References

  • D.L. Applegate, R.E. Bixby, V. Chvátal, and W.J. Cook. The traveling salesman problem: A computational study. Princeton University Press, Princeton, 2006.

    MATH  Google Scholar 

  • J. Bang-Jensen, G. Gutin, and A. Yeo. When the greedy algorithm fails. Discrete Optimization, 1:121–127, 2004.

    Article  MathSciNet  MATH  Google Scholar 

  • V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4:233–235, 1979.

    Article  MathSciNet  MATH  Google Scholar 

  • T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge, 3rd edition, 2009.

    MATH  Google Scholar 

  • A.R. Duarte, C.C. Ribeiro, and S. Urrutia. A hybrid ILS heuristic to the referee assignment problem with an embedded MIP strategy. In T. Bartz-Beielstein, M.J.B. Aguilera, C. Blum, B. Naujoks, A. Roli, G. Rudolph, and M. Sampels, editors, Hybrid metaheuristics, volume 4771 of Lecture Notes in Computer Science, pages 82–95. Springer, Berlin, 2007a.

    Google Scholar 

  • A.R. Duarte, C.C. Ribeiro, S. Urrutia, and E.H. Haeusler. Referee assignment in sports leagues. In E.K. Burke and H. Rudov, editors, Practice and theory of automated timetabling VI, volume 3867 of Lecture Notes in Computer Science, pages 158–173. Springer, Berlin, 2007b.

    Google Scholar 

  • J. Edmonds. Matroids and the greedy algorithm. Mathematical Programming, 1:125–136, 1971.

    Article  MathSciNet  MATH  Google Scholar 

  • T.A. Feo and M.G.C. Resende. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8:67–71, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  • T.A. Feo, M.G.C. Resende, and S.H. Smith. A greedy randomized adaptive search procedure for maximum independent set. Operations Research, 42: 860–878, 1994.

    Article  MATH  Google Scholar 

  • G. Gutin and A.P. Punnen, editors. The traveling salesman problem and its variations. Kluwer Academic Publishers, Boston, 2002.

    MATH  Google Scholar 

  • J.P. Hart and A.W. Shogan. Semi-greedy heuristics: An empirical study. Operations Research Letters, 6:107–114, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  • V. Jarník. O jistém problému minimálním. Práce Moravské Přírodovědecké Společnosti, 6:57–63, 1930.

    Google Scholar 

  • D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256–278, 1974.

    Article  MathSciNet  MATH  Google Scholar 

  • J.B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7: 48–50, 1956.

    Article  MathSciNet  MATH  Google Scholar 

  • E.L. Lawler. Combinatorial optimization: Networks and matroids. Holt, Rinehart and Winston, New York, 1976.

    MATH  Google Scholar 

  • E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, editors. The traveling salesman problem: A guided tour of combinatorial optimization. John Wiley & Sons, New York, 1985.

    MATH  Google Scholar 

  • S. Martello and P. Toth. Knapsack problems: Algorithms and computer implementations. John Wiley & Sons, New York, 1990.

    MATH  Google Scholar 

  • G.R. Mateus, M.G.C. Resende, and R.M.A. Silva. GRASP with path-relinking for the generalized quadratic assignment problem. Journal of Heuristics, 17: 527–565, 2011.

    Article  MATH  Google Scholar 

  • K. Melhorn. A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters, 27:125–128, 1988.

    Article  MathSciNet  Google Scholar 

  • H. Nishimura and S. Kuroda, editors. A lost mathematician, Takeo Nakasawa. The forgotten father of matroid theory. Birkhäuser Verlag, Basel, 2009.

    Google Scholar 

  • L.S. Pitsoulis. Topics in matroid theory. SpringerBriefs in Optimization. Springer, 2014.

    Book  MATH  Google Scholar 

  • R.C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389–1401, 1957.

    Article  Google Scholar 

  • H. Takahashi and A. Matsuyama. An approximate solution for the Steiner problem in graphs. Mathematica Japonica, 24:573–577, 1980.

    MathSciNet  MATH  Google Scholar 

  • H. Whitney. On the abstract properties of linear dependence. American Journal of Mathematics, 57:509–533, 1935.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Modeling and Optimization Group (MOP), Amazon.com, Inc., Seattle, WA, USA

    Mauricio G. C. Resende

  2. Instituto de Ciência da Computação, Universidade Federal Fluminense, Niterói, Rio de Janeiro, Brazil

    Celso C. Ribeiro

Authors
  1. Mauricio G. C. Resende
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Celso C. Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this chapter

Cite this chapter

Resende, M.G.C., Ribeiro, C.C. (2016). Solution construction and greedy algorithms. In: Optimization by GRASP. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-6530-4_3

Download citation

Publish with us

Policies and ethics

Search

Navigation