\BOOKMARK [1][-]{section.1}{Modelli}{}% 1
\BOOKMARK [2][-]{subsection.1.1}{Cenni di Base}{section.1}% 2
\BOOKMARK [2][-]{subsection.1.2}{Esercizi}{section.1}% 3
\BOOKMARK [3][-]{subsubsection.1.2.1}{Problema con Delta}{subsection.1.2}% 4
\BOOKMARK [3][-]{subsubsection.1.2.2}{Problema con massima distanza}{subsection.1.2}% 5
\BOOKMARK [3][-]{subsubsection.1.2.3}{Problema Variabile Triplo indice}{subsection.1.2}% 6
\BOOKMARK [3][-]{subsubsection.1.2.4}{Problema di Trasporto}{subsection.1.2}% 7
\BOOKMARK [3][-]{subsubsection.1.2.5}{Problema di Stoccaggio}{subsection.1.2}% 8
\BOOKMARK [3][-]{subsubsection.1.2.6}{Problema di Stoccaggio 2}{subsection.1.2}% 9
\BOOKMARK [1][-]{section.2}{Forme: Standard, Canonica, Generale}{}% 10
\BOOKMARK [2][-]{subsection.2.1}{Standard \040Canonica}{section.2}% 11
\BOOKMARK [2][-]{subsection.2.2}{Generale \040Standard}{section.2}% 12
\BOOKMARK [2][-]{subsection.2.3}{Esercizio Trasformazione Gran Fritto Misto}{section.2}% 13
\BOOKMARK [1][-]{section.3}{Matrici : LP, ILP}{}% 14
\BOOKMARK [2][-]{subsection.3.1}{Fondamenti Concettuali}{section.3}% 15
\BOOKMARK [3][-]{subsubsection.3.1.1}{Quale Simplesso?}{subsection.3.1}% 16
\BOOKMARK [2][-]{subsection.3.2}{LP}{section.3}% 17
\BOOKMARK [3][-]{subsubsection.3.2.1}{Simplesso}{subsection.3.2}% 18
\BOOKMARK [3][-]{subsubsection.3.2.2}{Simplesso Duale}{subsection.3.2}% 19
\BOOKMARK [3][-]{subsubsection.3.2.3}{2Fasi}{subsection.3.2}% 20
\BOOKMARK [3][-]{subsubsection.3.2.4}{Duale del problema}{subsection.3.2}% 21
\BOOKMARK [2][-]{subsection.3.3}{Rappresentazione Grafica}{section.3}% 22
\BOOKMARK [2][-]{subsection.3.4}{ILP}{section.3}% 23
\BOOKMARK [3][-]{subsubsection.3.4.1}{Tagli di Gomory}{subsection.3.4}% 24
\BOOKMARK [2][-]{subsection.3.5}{Esercizi Particolari}{section.3}% 25
\BOOKMARK [3][-]{subsubsection.3.5.1}{Simplesso con variabili free}{subsection.3.5}% 26
\BOOKMARK [3][-]{subsubsection.3.5.2}{Problema PLC con simplesso e gomory in salsa teriyaki}{subsection.3.5}% 27
\BOOKMARK [3][-]{subsubsection.3.5.3}{Senstivity Analysis}{subsection.3.5}% 28
\BOOKMARK [1][-]{section.4}{Grafi}{}% 29
\BOOKMARK [2][-]{subsection.4.1}{GT}{section.4}% 30
\BOOKMARK [3][-]{subsubsection.4.1.1}{Dijkstra}{subsection.4.1}% 31
\BOOKMARK [3][-]{subsubsection.4.1.2}{Shortest Path Tree}{subsection.4.1}% 32
\BOOKMARK [2][-]{subsection.4.2}{SST}{section.4}% 33
\BOOKMARK [3][-]{subsubsection.4.2.1}{Cenni di Base}{subsection.4.2}% 34
\BOOKMARK [3][-]{subsubsection.4.2.2}{SST Prim's}{subsection.4.2}% 35
\BOOKMARK [3][-]{subsubsection.4.2.3}{SST Da Matrice trovare la soluzione ottimale}{subsection.4.2}% 36
\BOOKMARK [2][-]{subsection.4.3}{Max Flow}{section.4}% 37
\BOOKMARK [3][-]{subsubsection.4.3.1}{Cenni di Base}{subsection.4.3}% 38
\BOOKMARK [3][-]{subsubsection.4.3.2}{Flow Network}{subsection.4.3}% 39
\BOOKMARK [2][-]{subsection.4.4}{DP}{section.4}% 40
\BOOKMARK [3][-]{subsubsection.4.4.1}{DP Knapsack 0-1 Dynamic Programming}{subsection.4.4}% 41
\BOOKMARK [3][-]{subsubsection.4.4.2}{DP: SSP Bellman's-Ford}{subsection.4.4}% 42
\BOOKMARK [2][-]{subsection.4.5}{ILP}{section.4}% 43
\BOOKMARK [3][-]{subsubsection.4.5.1}{ILP standard B\046B}{subsection.4.5}% 44
\BOOKMARK [3][-]{subsubsection.4.5.2}{ILP esercizio standard B\046B}{subsection.4.5}% 45
\BOOKMARK [3][-]{subsubsection.4.5.3}{ILP esercizio B\046B 0-1}{subsection.4.5}% 46
\BOOKMARK [1][-]{section.5}{GPLK}{}% 47
\BOOKMARK [2][-]{subsection.5.1}{Dal modello al codice}{section.5}% 48
\BOOKMARK [3][-]{subsubsection.5.1.1}{Modello Easy}{subsection.5.1}% 49
\BOOKMARK [3][-]{subsubsection.5.1.2}{Caso Particolare 1 Graffa}{subsection.5.1}% 50
\BOOKMARK [3][-]{subsubsection.5.1.3}{Caso Particolare 2 Sommatoria doppio insieme}{subsection.5.1}% 51
\BOOKMARK [2][-]{subsection.5.2}{Dal codice al modello}{section.5}% 52
\BOOKMARK [3][-]{subsubsection.5.2.1}{Normale}{subsection.5.2}% 53
\BOOKMARK [1][-]{section.6}{Domande varie di teoria}{}% 54
\BOOKMARK [2][-]{subsection.6.1}{PLC degenerate}{section.6}% 55
\BOOKMARK [2][-]{subsection.6.2}{PLC sensitivty}{section.6}% 56
\BOOKMARK [2][-]{subsection.6.3}{B\046B}{section.6}% 57
\BOOKMARK [2][-]{subsection.6.4}{PLC minimization}{section.6}% 58
\BOOKMARK [2][-]{subsection.6.5}{cutting Plane}{section.6}% 59
\BOOKMARK [2][-]{subsection.6.6}{PLC dual}{section.6}% 60
\BOOKMARK [2][-]{subsection.6.7}{Dijkstra}{section.6}% 61
\BOOKMARK [2][-]{subsection.6.8}{B\046B knapsack}{section.6}% 62
\BOOKMARK [2][-]{subsection.6.9}{Branch \046 cut}{section.6}% 63
\BOOKMARK [2][-]{subsection.6.10}{PLC}{section.6}% 64
\BOOKMARK [2][-]{subsection.6.11}{Soluzione Base}{section.6}% 65
\BOOKMARK [2][-]{subsection.6.12}{Ford-Fulkerson}{section.6}% 66
\BOOKMARK [2][-]{subsection.6.13}{PLI minimization \046 relaxation}{section.6}% 67
\BOOKMARK [2][-]{subsection.6.14}{B\046B knapsack 0-1}{section.6}% 68
\BOOKMARK [2][-]{subsection.6.15}{NP problem}{section.6}% 69