Pinedo – Theory, algorithms

Argomenti del programma: Introduction. Brief review of mathematical programming models for graph and network optimization problems (paths, trees, minimum cost flow, maximum flow, travelling salesman problem, knapsack problem). Brief review of the Branch-and-Bound method and Cutting Plane algorithms (Gomory cuts). Flow routing and Fixed Charge Network Design problems .

Argomenti del programma: Introduction. Brief review of mathematical programming models for graph and network optimization problems (paths, trees, minimum cost flow, maximum flow, travelling salesman problem, knapsack problem). Brief review of the Branch-and-Bound method and Cutting Plane algorithms (Gomory cuts). Flow routing and Fixed Charge Network Design problems .

Argomenti del programma: Introduction. Brief review of mathematical programming models for graph and network optimization problems (paths, trees, minimum cost flow, maximum flow, travelling salesman problem, knapsack problem). Brief review of the Branch-and-Bound method and Cutting Plane algorithms (Gomory cuts). Flow routing and Fixed Charge Network Design problems .

• Ulteriore materiale verrà fornito durante il corso in forma di slide ed esercizi svolti.

Argomenti del programma: Introduction. Brief review of mathematical programming models for graph and network optimization problems (paths, trees, minimum cost flow, maximum flow, travelling salesman problem, knapsack problem). Brief review of the Branch-and-Bound method and Cutting Plane algorithms (Gomory cuts). Flow routing and Fixed Charge Network Design problems .