A short tour of combinatorial optimization and computational complexity

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 2 in Optimization by GRASP, 2016, pp 13-39 from Springer

Abstract: Abstract This chapter introduces combinatorial optimization problems and their computational complexity. We first formulate some fundamental problems already introduced in the previous chapter and then consider basic concepts of the theory of computational complexity, with special emphasis on decision problems, polynomial-time algorithms, and NP-complete problems. The chapter concludes with a discussion of solution approaches for NP-hard problems, introducing constructive heuristics, local search or improvement procedures and, finally, metaheuristics.

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_2

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

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

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 ().