Solution construction and greedy algorithms

Mauricio G. C. Resende and Celso C. Ribeiro
Additional contact information
Mauricio G. C. Resende: Amazon.com, Inc., Modeling and Optimization Group (MOP)
Celso C. Ribeiro: Universidade Federal Fluminense, Instituto de Ciência da Computação

Chapter Chapter 3 in Optimization by GRASP, 2016, pp 41-62 from Springer

Abstract: 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.

Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4939-6530-4_3

Ordering information: This item can be ordered from
http://www.springer.com/9781493965304

DOI: 10.1007/978-1-4939-6530-4_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().