Mixed Integer Program
15 items
- Separierungsproblem/
- Branch-and-Bound Verfahren
- Capacitated Lot-Sizing Problem
- Cut-Set Bedingung
- Gemischt-ganzzahliges lineares Optimierungsproblem
- Knapsack Problem
- LP-Relaxierung
- Prune by Bound
- Prune by Infeasibility
- Prune by Integrality
- Relaxierung
- Subtour Elimination Bedingung
- Traveling Salesman Problem
- Uncapacitated Facility Location Problem
- Uncapacitated Lot-Sizing Problem