Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications

Authored by: Ravindra K. Ahuja , Özlem Ergun , James B. Orlin , Abraham P. Punnen

Handbook of Approximation Algorithms and Metaheuristics, Second Edition

Print publication date:  May  2018
Online publication date:  May  2018

Print ISBN: 9781498770118
eBook ISBN: 9781351236423
Adobe ISBN:

10.1201/9781351236423-18

 Download Chapter

 

Abstract

A combinatorial optimization problem (COP) P consists of a collection of its instances. An instance of P can be represented as an ordered pair (F, f), where F is the family of feasible solutions and f is the objective function, which is used to compare two feasible solutions. The family F is formed by subsets of a finite set E = {1, 2, …, m} called the ground set. The objective function f : F → Q + ∪ { 0 } assigns a nonnegative cost to every feasible solution S in F. The Traveling Salesman Problem (TSP) and the Minimum Spanning Tree Problem are typical examples of COPs.

 Cite
Search for more...
Back to top

Use of cookies on this website

We are using cookies to provide statistics that help us give you the best experience of our site. You can find out more in our Privacy Policy. By continuing to use the site you are agreeing to our use of cookies.