Combinatorial Optimization G(V, E)

Abstract

Combinatorics is generally concerned with the arrangement, grouping, ordering, or selection of a discrete set of objects usually finite in number [8]. Combinatorial Optimization (CO) is concerned with finding the “best” arrangement, grouping, or ordering of a set of discrete objects. Combinatorial Optimization problems are a sub-class of OR and CS problems for which many applications abound. Graph algorithms such as the Minimum Spanning Tree and Shortest Paths are excellent example problems for CO. Figure 2.1 illustrates alternative shortest path topologies for an accessibility map at the University of Massachusetts to help guide people across the campus.