Ahuja – Network flows, algorithms and applications

• All the course information and material will be available on WeBeep.

Argomenti del programma: 1. Introduction Decision-making problems. Main steps of an O.R. study. Different types of optimization (mathematical programming) problems. Optimization models (decision variables, objective function, constraints) and modeling techniques. 2. Graph and network optimization Optimum spanning trees. Shortest path problems: algorithms for the main variants (including Dynamic programming for acyclic graphs).

• All the course information and material will be available on WeBeep.

Argomenti del programma: 1. Introduction Decision-making problems. Main steps of an O.R. study. Different types of optimization (mathematical programming) problems. Optimization models (decision variables, objective function, constraints) and modeling techniques. 2. Graph and network optimization Optimum spanning trees. Shortest path problems: algorithms for the main variants (including Dynamic programming for acyclic graphs).

• All the course information and material will be available on WeBeep.

Argomenti del programma: 1. Introduction Decision-making problems. Main steps of an O.R. study. Different types of optimization (mathematical programming) problems. Optimization models (decision variables, objective function, constraints) and modeling techniques. 2. Graph and network optimization Optimum spanning trees. Shortest path problems: algorithms for the main variants (including Dynamic programming for acyclic graphs).

• All the course information and material will be available on WeBeep.

Argomenti del programma: 1. Introduction Decision-making problems. Main steps of an O.R. study. Different types of optimization (mathematical programming) problems. Optimization models (decision variables, objective function, constraints) and modeling techniques. 2. Graph and network optimization Optimum spanning trees. Shortest path problems: algorithms for the main variants (including Dynamic programming for acyclic graphs).

• All the course information and material will be available on WeBeep.

Argomenti del programma: 1. Introduction Decision-making problems. Main steps of an O.R. study. Different types of optimization (mathematical programming) problems. Optimization models (decision variables, objective function, constraints) and modeling techniques. 2. Graph and network optimization Optimum spanning trees. Shortest path problems: algorithms for the main variants (including Dynamic programming for acyclic graphs).

• All the course information and material will be available on WeBeep.

Argomenti del programma: 1. Introduction Decision-making problems. Main steps of an O.R. study. Different types of optimization (mathematical programming) problems. Optimization models (decision variables, objective function, constraints) and modeling techniques. 2. Graph and network optimization Optimum spanning trees. Shortest path problems: algorithms for the main variants (including Dynamic programming for acyclic graphs).

• Course information and material will be available on WeBeep.

Argomenti del programma: Introduction. Presenting applications of linear and discrete optimization. Introducing the steps required for formulating optimization problems (decision variables, objective function, constraints). Modeling techniques for Linear Programming and Integer Linear Programming. Linear Programming (LP). LP models. Geometric aspects (vertices of the feasible region) and algebraic aspects (basic feasible solutions).

• All the course information and material will be available on WeBeep.

Argomenti del programma: 1. Introduction Decision-making problems. Main steps of an O.R. study. Different types of optimization (mathematical programming) problems. Optimization models (decision variables, objective function, constraints) and modeling techniques. 2. Graph and network optimization Optimum spanning trees. Shortest path problems: algorithms for the main variants (including Dynamic programming for acyclic graphs).