Combinatorial Optimization G(V, E)

J. MacGregor Smith ()
Additional contact information
J. MacGregor Smith: University of Massachusetts

Chapter Chapter 2 in Combinatorial, Linear, Integer and Nonlinear Optimization Apps, 2021, pp 19-82 from Springer

Abstract: Overview Combinatorics is generally concerned with the arrangement, grouping, ordering, or selection of a discrete set of objects usually finite in number [8].Combinatorics 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.

Date: 2021
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:spochp:978-3-030-75801-1_2

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

DOI: 10.1007/978-3-030-75801-1_2

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().