Advertisement

Introduction

  • Christian Blum
  • Günther R. Raidl
Chapter
Part of the Artificial Intelligence: Foundations, Theory, and Algorithms book series (AIFTA)

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}\).

Keywords

Travel Salesman Problem Constraint Satisfaction Problem Greedy Randomize Adaptive Search Procedure Variable Neighborhood Search Tabu List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Christian Blum
    • 1
  • Günther R. Raidl
    • 2
  1. 1.Dept. of Computer Science and Artificial IntelligenceUniversity of the Basque CountrySan SebastianSpain
  2. 2.Algorithms and Data Structures GroupVienna University of TechnologyViennaAustria

Personalised recommendations