The page uses Browser Access Keys to help with keyboard navigation. Click to learn moreSkip to Navigation

Different browsers use different keystrokes to activate accesskey shortcuts. Please reference the following list to use access keys on your system.

Alt and the accesskey, for Internet Explorer on Windows
Shift and Alt and the accesskey, for Firefox on Windows
Shift and Esc and the accesskey, for Windows or Mac
Ctrl and the accesskey, for the following browsers on a Mac: Internet Explorer 5.2, Safari 1.2, Firefox, Mozilla, Netscape 6+.

We use the following access keys on our gateway

n Skip to Navigation
k Accesskeys description
h Help
Oakland University Logo
    Oakland University
  Jan 24, 2018
2015-2017 Graduate Catalog [ARCHIVED CATALOG]

[Add to Portfolio]

APM 664 - Combinatorial Optimization

(4 credits)

Duality and Farkas’ Lemma. Efficient algorithms, optimality conditions and polyhedral structures of problems in discrete optimization including optimal trees, optimal matchings and minimum-cost flow. Additional topics to include theory, approximation algorithms, matroid optimization and cutting planes algorithm for studying problems such as the traveling salesman and stable set problems.

Prerequisite(s): Student must meet prerequisite (APM 563) or have instructor permission.

Course revisions made after the Graduate Catalog publication date will be posted in the Graduate Catalog Addendum.

[Add to Portfolio]