Notes on Combinatorial Optimization

Active / Technical Report | Accession Number: ADA455247 |

Contents Introduction Minimum Spanning Trees Shortest Paths Polyhedral Combinatorics Facts of Polyhedra Ellipsoids.

Author(s):

Author Organization(s):

Descriptive Note:

Technical rept.

Supplementary Note:

DOI: 10.21236/ADA455247

Pagination:

0070

Distribution:

Approved For Public Release

Distribution Statement:

Approved For Public Release; Distribution Is Unlimited.

Collection: TR

Identifying Numbers

Report Number(s):

TR-87-21

Contract/Grant Number(s):

AFOSR-87-0276

Monitor Series:

AFOSR

Subject Terms

Joint Capability Areas:

JCA_8_Building Partnerships

Communities of Interest:

No COI(s) Identified

Descriptor(s):

*COMBINATORIAL ANALYSIS, ALGORITHMS, OPTIMIZATION, GRAPHS, LINEAR PROGRAMMING, ELLIPSOIDS

Field(s)/Group(s):

Statistics and Probability, Operations Research

Keyword(s):

COMBINATORIAL OPTIMIZATION, MINIMUM SPANNING TREES, POLYHEDRA, POLYHEDRON, TRAVELING SALESMAN PROBLEM, SHORTEST PATH PROBLEM

Report Date:

1987 Oct 16

Creation Date:

2006 Oct 25