MATH3215 · 3
Chapter outline · Relaxation, branching, and integrality
Definitions and theorem statements recorded in the web, in note order, with the exact proof steps behind their recorded connections.
0 of 4 public sections have indexed statements. This outline covers only those statements, not every theorem in the chapter. Recorded connections are still being reviewed.
Relaxation, branching, and integrality
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
0–1 knapsack by dynamic programming
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Lagrangian upper bounds for discrete decisions
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Binary decisions and mixed-integer modeling
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.