Abstract
In the seminal work of Papadimitriou and Steiglitz [216] a combinatorial optimization (CO) problem \(\mathcal{P}=(\mathcal{P},f)\) is defined by means of a finite set of objects \(\mathcal{P}\) and an objective function \(f:\mathcal{P}\mapsto\mathbb{R}^{+}\) that assigns a non-negative cost value to each of the objects \(s\in\mathcal{P}\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Blum, C., Raidl, G.R. (2016). Introduction. In: Hybrid Metaheuristics. Artificial Intelligence: Foundations, Theory, and Algorithms. Springer, Cham. https://doi.org/10.1007/978-3-319-30883-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-30883-8_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30882-1
Online ISBN: 978-3-319-30883-8
eBook Packages: Computer ScienceComputer Science (R0)