Per gli studenti di Ricerca Operativa e Laboratorio di Ricerca Operativa a.a. 2021-22 II semestre
Inizio lezioni: lunedi 21 febbraio 2022
Termine lezioni: giovedi 26 maggio 2022
Link per seguire le lezioni a distanza sulla piattaforma Zoom
https://uniroma1.zoom.us/j/85266894248?pwd=akd5MCtJeE52YmdwRXg1U3pFa25rQT09
Link alla piattaforma Moodle:
Ricerca Operativa https://elearning.dss.uniroma1.it/course/view.php?id=141
Laboratorio di Ricerca Operativa: https://elearning.dss.uniroma1.it/course/view.php?id=176
Si raccomanda fortemente la frequenza in presenza, in particolare per le attività in aula informatica.
Programma e sequenza temporale degli argomenti
- Introduzione
- Che cosa è la Ricerca Operativa. Breve storia della Ricerca Operativa. La Ricerca Operativa oggi.
- L’approccio modellistico.
- Modelli della Ricerca Operativa.
- La Programmazione Matematica
- Problemi di Ottimizzazione.
- Definizioni fondamentali.
- Classificazione dei problemi di Ottimizzazione.
- Modelli di Programmazione Matematica.
- Modelli di Programmazione Lineare
- Generalità. Struttura di un modello di Programmazione Lineare.
- Modelli di allocazione ottima di risorse.
- Modelli di miscelazione.
- Modelli di trasporto.
- La Programmazione Lineare
Struttura di un problema di Programmazione Lineare.
• Interpretazione geometrica di un Problema di Programmazione Lineare.
- Teoria della Programmazione Lineare
- Richiami di geometria di Rn . Insiemi Convessi. Vertici.
- Caratterizzazione ed esistenza dei vertici dell’insieme ammissibile di un problema di Programmazione Lineare.
- Il Teorema fondamentale della Programmazione Lineare.
- Il metodo del simplesso
- La forma standard e la forma canonica ammissibile.
- Vertici e soluzioni di base.
- La fase II del metodo del simplesso. Criterio di ottimalità. Criterio di illimitatezza.
- Determinazione di una nuova base ammissibile.
- Convergenza del metodo del simplesso.
- La fase I del metodo del simplesso.
- Teoria della dualità per la Programmazione Lineare
- Costruzione del problema duale di un problema di Programmazione lineare.
- Dualità in forma debole e condizione sufficiente di ottimalità.
- Dualità in forma forte e condizioni di ortogonalità.
- Modelli di Programmazione Lineare Intera
- Variabili intere per rappresentare quantità indivisibili.
- Variabili binarie per rappresentare scelte alternative. Problemi di assegnamento. Problemi di Knapsack binario. Problemi di Capital Budgeting.
- Variabili binarie come variabili indicatrici e relazioni logiche. Problema del costo fisso. Problemi di set covering, set partitioning e set packing. Problemi di localizzazione di impianti.
- La Programmazione Lineare Intera
- Relazioni tra Programmazione Lineare Intera e Programmazione Lineare.
- Rilassamenti lineari di problemi di Programmazione Lineare Intera.
- Metodi generali per la soluzione di problemi di Programmazione Lineare Intera
• La tecnica del Branch and Bound.
• Soluzione del problema di Knapsack binario.
- Problemi di flusso intero su rete
- Esempi
- Formulazione del problema di flusso intero di costo minimo
- Totale unimodularità e proprietà di interezza
- Versione capacitata
- Simplesso su rete
- Algoritmi di ricerca locale
- Progettazione di un algoritmo di ricerca locale
- Definizioni di intorni di un punto nel caso discreto
- Tecniche per evitare ottimi locali di cattiva qualità: multistart e peggioramenti locali
- Algoritmo generale di discesa
- Problema del commesso viaggiatore e algoritmo di Lin e Kernighan
- Cenni alla programmazione multiobiettivo
- Formulazione di un problema di PL multiobiettivo
- Soluzioni efficienti e frontiera di Pareto
- Risoluzione grafica
- Metodo dei pesi e metodo e-constrained
Bibliografia
D.Bertsimas, J.N Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, Belmont, Massachusetts, (1997);
L.A. Wolsey (1998) Integer Programming, Wiley;
M. Conforti, G. Cornuéjols & G. Zambelli (2015) Integer Programming, Springer.
Per gli studenti di Networks Analytics a.a. 2021-22 II semestre
Inizio lezioni: lunedi 21 febbraio 2022
Termine lezioni: giovedi 26 maggio 2022
Si raccomanda fortemente la frequenza in presenza, in particolare per le attività in aula informatica.
Link per seguire le lezioni a distanza sulla piattaforma Zoom
https://uniroma1.zoom.us/j/84635883467?pwd=ck5ySVJ1L0dFTXNZVUhneitiMmhYQT09
Bibliografia:
Cambridge University Press
David Easley,Jon Kleinberg
Networks, Crowds, and Markets: Reasoning about a Highly Connected World
Cambridge University Press
Eric D. Kolaczyk
Statistical Analysis of Network Data
Methods and Models, Springer
Contenuti e loro sequenza temporale:
1 Introduzione
2 Teoria dei Grafi (1)
3 Teoria dei Grafi (2)
4 Algoritmi di Visita di Grafi
5 Alberi ricoprenti
6 Cammini minimi
7 Random Networks
8 Random Networks e Gephi
9 Random Networks (2)
10 Small World and the Watts Strogatz Model
11 Esercitazione Analisi Reti
12 Scale Free Networks (1)
13 Scale Free Networks (2) e Progetti
14 Lab Network Analysis - Practice
15 Scale Free Networks Generation e Barabasi Albert Model
16 Models of Preferential Attachment
17 Centrality Measures
18 Introduzione a NetworkX
19 Grafi Triangolati
20 Esercitazione NetworkX
21 Communities (1)
22 Communities (2) - Maximal Cliques
23 Network Clustering
24 Degree Correlation (1)
25 Degree Correlation (2)
26 Network Robustness (1)
27 Network Robustness (2)
28 Spreading Phenomena (2)
29 Spreading Phenomena (3)
30 Network Robustness
31 Cascading Behaviour in Networks
32 Cascading Behaviour in Networks 2
Il metodo didattico adottato prevede spiegazioni da parte del docente con riferimenti a materiale didattico (slides e libri) e dei momenti marcatamene interattivi in aula e in laboratorio con riferimento all'utilizzo delle metodiche del corso per problemi reali.
L'esame consiste in un test scritto con esercizi, domande a riposta aperta e domande chiuse e la realizzazione di un progetto. Il test contribuisce per il 70% al voto finale, il progetto per il rimanente 30%.
Ricevimento studenti: Martedi alle 15, stanza 42, quarto piano, Dipartimento di Scienze Statistiche, preferibilemente inviare una mail preventiva.
For the Students of Data Driven Decision Making (DDDM) and Laboratory of Data Driven Decision Making (DDDMLAB) a.a. 2021-22 I semester.
Your physical presence during the lessons is strongly recommended, especially for the Laboratory of DDDM.
If you really cannot join us at the University, here is the link to the Zoom Platform:
https://uniroma1.zoom.us/j/88204317980?pwd=Uk96YlV3bXMwWEVtQ0RnSkNwcDN1dz09
Link to Moodle for DDDM and DDDM Laboratory:
https://elearning.dss.uniroma1.it/course/view.php?id=93
The teaching method adopted foresees explanations by the teacher with references to teaching material (slides and books) and markedly interactive moments in the classroom and in the laboratory with reference to the adoption of the course methods for real problems.
Suggested readings:
Denis Bouyssou and Philippe Vinke, Binary Relations and Preference Modeling
Simon French Decision Theory: a Introduction to the Mathematics of Rationality
Chapters 3 (paragraph 3.7 excluded), Chapters 4 (paragraph 4.5 excluded)
C.H. Antunes, M.J. Alves, J. Climacao
Multiobjective Linear and Integer Programming
Chapters 1, 2, 3, and the paragraphs 4.1, 4.2, 6.1, 6.2 A.
Ishizaka, P. Nemery
Multi-Criteria Decision Analysis
Chapters 1, 2, 4, 6, 7, 9
D. Bertsimas et al. The Analytics Edge Chapters 10, 12, 13, 14
The exam consists in a written text with some exercises and questions (open and with multiple choices).
For the DDDM LAB we will work togher in the class using different software tools. The Lab will be concluded with an original project (small groups are allowed). To get the (3CFU) a final practical test has to be passed succefully.
Office hours (for students): Thesday at 3 pm, room 42, fourth floor, Dipartimento di Scienze Statistiche, please email me in advance.
Course Contents:
- Introduction to Data Driven Decision Making
- Introduction to Part I
- Data, Objectives, Measurements and Decisions: The Balanced Scorecard
- Choice Problems, Decision Maker Preferences and Ordinal Value Functions
- Properties of Preference Relations
- Weak Orders and Ordinal Value Functions
- Semiorders and Interval Orders – Combinatorial and Analytic Representations
- Multi Attribute Preferences
- Analytic Hierarchy Process - AHP
- ELECTRE Method
- UTA+ Method
- Promethee Method
- Introduction to Part II
- Mathematical Programming for Decision Making
- Goal Programming
- Integer and 0-1 Programming in Decision Making
- Multiobjective Optimization
- Exploring Objective Space: Scalarizing Techniques
- Stem Method
- Zionts-Wallenius Method
- Computational Complexity in Decision Making
- Introduction to Part III
- Collective Decision Making and Collective Intelligence
- Metric Approach to Collective Decision Making
- Fraud Detection and Relational Data Analysis
- Auctions and Google Ads
- Analytics for Kidney Allocation
- Recommendation Systems
Insegnamento | Codice | Anno | Corso - Frequentare | Bacheca |
---|---|---|---|---|
LABORATORY OF DATA DRIVEN DECISION MAKING | AAF1884 | 2022/2023 | ||
NETWORK ANALYTICS | 1055807 | 2022/2023 | ||
DATA DRIVEN DECISION MAKING | 10589563 | 2022/2023 | ||
LABORATORY OF DATA DRIVEN DECISION MAKING | AAF1884 | 2022/2023 | ||
DATA DRIVEN DECISION MAKING | 10589563 | 2022/2023 | ||
DATA DRIVEN DECISION MAKING | 10589563 | 2022/2023 | ||
LABORATORIO DI RICERCA OPERATIVA | AAF1392 | 2021/2022 | ||
RICERCA OPERATIVA | 1017411 | 2021/2022 | ||
NETWORK ANALYTICS | 1055807 | 2021/2022 | ||
LABORATORY OF DATA DRIVEN DECISION MAKING | AAF1884 | 2020/2021 | ||
METODI E MODELLI PER LA LOGISTICA | 1052056 | 2020/2021 | ||
NETWORK ANALYTICS | 1055807 | 2020/2021 | ||
DATA DRIVEN DECISION MAKING | 10589563 | 2020/2021 | ||
LABORATORY OF DATA DRIVEN DECISION MAKING | AAF1884 | 2020/2021 | ||
DATA DRIVEN DECISION MAKING | 10589563 | 2020/2021 | ||
DATA DRIVEN DECISION MAKING | 10589563 | 2020/2021 | ||
LABORATORY OF DATA DRIVEN DECISION MAKING | AAF1884 | 2019/2020 | ||
DATA DRIVEN DECISION MAKING | 10589563 | 2019/2020 | ||
NETWORK ANALYTICS | 1055807 | 2019/2020 | ||
LABORATORY OF DATA DRIVEN DECISION MAKING | AAF1884 | 2019/2020 | ||
DATA DRIVEN DECISION MAKING | 10589563 | 2019/2020 | ||
DATA DRIVEN DECISION MAKING | 10589563 | 2019/2020 | ||
NETWORK ANALYTICS | 1055807 | 2018/2019 | ||
DATA DRIVEN DECISION MAKING | 1055950 | 2018/2019 | ||
DATA DRIVEN DECISION MAKING | 1055950 | 2018/2019 | ||
LABORATORIO DI OTTIMIZZAZIONE | AAF1455 | 2017/2018 | ||
MODELLI PER IL SUPPORTO ALLE DECISIONI | 1038213 | 2017/2018 | ||
DATI RETI E SISTEMI | 1035129 | 2017/2018 | ||
MODELLI PER IL SUPPORTO ALLE DECISIONI | 1038213 | 2017/2018 | ||
OTTIMIZZAZIONE | 1023916 | 2016/2017 | ||
MODELLI PER IL SUPPORTO ALLE DECISIONI | 1038213 | 2016/2017 | ||
DATI RETI E SISTEMI | 1035129 | 2016/2017 | ||
MODELLI PER IL SUPPORTO ALLE DECISIONI | 1038213 | 2016/2017 |
Martedi: ore 15:00, stanza 42, quarto piano, Dipartimento di Scienze Statistiche (se possibile inviare una mail preventiva)
Tuesday: 3 pm, room 42, fourth floor, Department of Statistical Science (please email me in advance)
http://www.dss.uniroma1.it/it/dipartimento/persone/dellolmo-paolo
Current positions
Full Professor of Operations Research at the Department of Statistical Sciences of Sapienza University of Rome (Facoltà di Ingegneria dell Informazione, Informatica e Statistica). Director of the Master Program in Data Intelligence and Strategic Decisions. Director of the Course in "Scienze Forensi e Intelligence per L'investigazione Privata", Member of the Scientific Committee of the Research Center of Cyber Intelligence and Information Security (CIS). Member of the of the Board of Directors of Fondazione Roma Sapienza. Member of the Italian Association of Operations Research. Chairman of the Organizing Committee of the ICORES 2016 International Conference on Operations Research and Enterprise Systems.
Held Positions
Department Head (2005-2011). Coordinator of the PhD program in Operations Research (2005-2011). National Coordinator of Prin projects in Transportation and Logistics (2003, 2005, 2007). Director of the Master Program in Statistics for the Management of Information Systems (2006-2010). Director of the Master Program in Data Intelligence and Strategic Decisions (2002-now).
Research
My research interest are mainly in combinatorial optimization also applied to real life problems. In particular: Computational Complexity, Design and Analysis of Exact and Approximated Algorithms, Sequencing and Scheduling, Decision Support Systems, Air Traffic Management, Logistics, Coordination of Traffic Flows on Networks.
Recent Research Projects (Scientific Coordinator)
Models for the Management of Goods for Maritime Terminal, Logistic Platforms and Multimodal Transportation Networks (PRIN: Ministry of Research, National Coordinator)
Infomobility and the Design of Integrated Urban Transportation Systems (PRIN: Ministry of Research, National Coordinator)
Simulation of Traffic flows in the Italian Railway Network (Italian Railways)
A system for measuring service quality (Aeroporti di Roma)
E-Log Logistic System (Gioia Tauro Harbour)
Member of International Scientific Committee (selection)
DIMACS 9th Implementation Challenge on Shortest Path Problems (DIMACS Centre, Rutgers University, Piscataway, NJ, 2006).
Triennial Symposium on Transportation (TRISTAN, Phuket Island, Thailand 2007)
Italian International Conference of Operation Research (Genoa 2007), Scientific Chairman
BIOGRAPHICAL SKETCH
Paolo Dell Olmo received his Laurea Degree in Electronic Engineering at the University of Rome "La Sapienza" (1987), Italy. Researcher at the Istituto di Analisi Sistemi e Informatica of the Italian National Research Council - Rome (1994), then researcher at the Faculty of Management Engineering at the University of Rome Tor Vergata (1994) and associated professor at the Faculty of Statistics (1998) of the University of Rome La Sapienza . Full professor in Operations Research since 2000. He has been visiting scholar at the Department of Systems and Industrial Engineering of University of Arizona (1992-93), visiting professor at the Operation Research Center of MIT (1998). He has been responsible of several national and international research projects and author of more than 70 scientific papers published on international journals.
PUBLICATIONS
For un updated list of publication see the web sites :
http://ams.math.uni-bielefeld.de/mathscinet/
http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/d/Dell=Olmo:Pa...
PRINCIPAL PUBLICATIONS
A New Mixed Integer Linear Programming Formulation For A Maintenance Problem In Italian Railways" (with L. Amorosi and G.L. Giacco), CASPT 2015 International Conference, July 2015, Rotterdam.
"A new approach for train calendar description generation" (with L. Amorosi and G.L. Giacco), MT-ITS 2015 International Conference, June 2015, Budapest.
Sleep to stay alive: Optimizing Reliability in Energy-Efficient Backbone Networks (with, L. Amorosi, L. Chiaraviglio, M. Listanti) RONEXT 2015 International Workshop, July 2015, Budapest.
Lifetime-Aware ISP Networks: Optimal Formulation and Solutions (with L. Amorosi, L. Chiaraviglio, A.Cianfrani, J.A Gutierrez, M.Polverini, E.Le Rouzic, M.Listanti, W.Liu), Transactions on Networking. (submitted)
LIFETEL: Managing the Energy-Lifetime Tradeoff in Telecommunication Networks (with L. Amorosi, A.Baiocchi, L.Chiaraviglio, A.Cianfrani, F.Cuomo, M.Listanti), Communications Magazine Series on Green Communications and Computing Networks, 2016 . (in press)
Optimal Sustainable Management of Backbone Networks (with, L. Amorosi ,L. Chiaraviglio, M. Listanti) ICTON 2016 International Conference , July 2016, Trento.
A Mathematical Programming Approach for Calendar Generation (with L. Amorosi, and G.L.Giacco), Omega-The international Journal of Management Science. (submitted)
T.G.Crainic, P.Dell'Olmo, N.Ricciardi, A.Sgalambro (2015). Modeling dry-port-based freight
distribution planning. TRANSPORTATION RESEARCH. PART C, EMERGING TECHNOLOGIES, p. --,
ISSN: 0968-090X, doi: 10.1016/j.trc.2015.03.026
Francesco Carrabs, Raffaele Cerulli, Paolo Dell'Olmo (2014). A Mathematical Programming Approach
for the Maximum Labeled Clique Problem. PROCEDIA: SOCIAL & BEHAVIORAL SCIENCES, vol. 108,
p. 69-78, ISSN: 1877-0428, doi: 10.1016/j.sbspro.2013.12.821
Paolo Dell'Olmo, Nicoletta Ricciardi, Antonino Sgalambro (2014). A Multiperiod Maximal Covering
Location Problem for the optimal intersection safety cameras on a urban traffic network.
PROCEDIA: SOCIAL & BEHAVIORAL SCIENCES, vol. 108, p. 106-117, ISSN: 1877-0428, doi:
10.1016/j.sbspro.2013.12.82
G. Andreatta, Paolo Dell'Olmo, G. Lulli (2011). Strategic Aircraft Flow Re-allocation vs Dynamic Air
Traffic Flow Management. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol. 215, p. 697-704,
ISSN: 0377-2217
M. Caramia, P. Dellolmo, I.N. Exact Graph Coloring Algorithms Evaluating The Effects Of The Clique
Selection, International Journal O.F. Operational Research, Paolo Dell'Olmo (2011).
Caramia, M. Dell Olmo, P., Evaluating the Effects of the Clique Selection in Exact Graph Coloring Algorithms , International Journal of Operational Research, in press.
CARAMIA M, DELL'OLMO P. (2008). Coloring Graphs by Iterated Local Search Traversing Feasible and Infeasible Solutions. DISCRETE APPLIED MATHEMATICS, vol. 156; p. 201-217, ISSN: 0166-218.
Scheduling.
M.Caramia, P.Dell Olmo, P (2008). Multi-objectives Management in Freight Logistics Systems:Increasing Capacity, Service Level and Safety with Optimisation Algorithms. HEIDELBERG: Springer
T.G.Crainic, P.Dell'Olmo, N.Ricciardi, A.Sgalambro (2015). Modeling dry-port-based freight
distribution planning. TRANSPORTATION RESEARCH. PART C, EMERGING TECHNOLOGIES, p. --,
ISSN: 0968-090X, doi: 10.1016/j.trc.2015.03.026
Francesco Carrabs, Raffaele Cerulli, Paolo Dell'Olmo (2014). A Mathematical Programming Approach
for the Maximum Labeled Clique Problem. PROCEDIA: SOCIAL & BEHAVIORAL SCIENCES, vol. 108,
p. 69-78, ISSN: 1877-0428, doi: 10.1016/j.sbspro.2013.12.821
Paolo Dell'Olmo, Nicoletta Ricciardi, Antonino Sgalambro (2014). A Multiperiod Maximal Covering
Location Problem for the optimal intersection safety cameras on a urban traffic network.
PROCEDIA: SOCIAL & BEHAVIORAL SCIENCES, vol. 108, p. 106-117, ISSN: 1877-0428, doi:
10.1016/j.sbspro.2013.12.82
G. Andreatta, Paolo Dell'Olmo, G. Lulli (2011). Strategic Aircraft Flow Re-allocation vs Dynamic Air
Traffic Flow Management. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol. 215, p. 697-704,
ISSN: 0377-2217
M. Caramia, P. Dellolmo, I.N. Exact Graph Coloring Algorithms Evaluating The Effects Of The Clique
Selection, International Journal O.F. Operational Research, Paolo Dell'Olmo (2011). Evaluating the
Effects of the Clique Selection in Exact Graph Coloring Algorithms. INTERNATIONAL JOURNAL OF
OPERATIONAL RESEARCH, vol. 11, p. 179-192, ISSN: 1745-7645, doi: 10.1504/ijor.2011.040696 -
M. Caramia P.Dell Olmo, G.Lulli, A.Iovanella, B.Scoppola, Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates, Computer and Operations Research, (vol. 35; p. 1589-1600, ISSN: 0305-0548).
Dell'Olmo, Paolo; Gentili, Monica: Graph models for scheduling systems with machine saturation property. Math. Methods Oper. Res. 63 (2006), no. 2, 329 340.
Caramia, M., Dell Olmo, P., Iovanella A., "Lower Bounds Algorithms for Multiprocessor Task Scheduling with Ready Times", International Transaction in Operations Research (2005).
Caramia M., Dell'Olmo P., "Assessing the Resource Usage in Scheduling with Incompatibilities", Operations Research Spectrum, 25 (4), 521-547 (2003).
Caramia, M., Dell'Olmo, P., Onori, R. "Minimum makespan task sequencing with multiple shared resources" (2004) Robotics and Computer-Integrated Manufacturing, 20 (2), 143-150.
Confessore G., Dell'Olmo P., Giordani, S., "Complexity and Approximation Results for Scheduling Multiprocessor Tasks on a Ring", Discrete Applied Mathematics 133 (2004) 29-44.
Blazewicz, J., Dell Olmo P., Drozdowski M., Przemyslaw Maczka, "Scheduling multiprocessor tasks on parallel processors with limited availability", European Journal on Operational Research, 149, 377-389 (2003).
Blazewicz J., Dell'Olmo P., Drozdowski M., Scheduling multiprocessor tasks on two parallel processors. RAIRO Oper. Res (2002) 37-57.
Caramia M., Dell'Olmo P., "On-line Algorithms for Multiprocessor Task Scheduling with Ready Times", Foundations of Computing and Decisions Science 26 (3), 197-214, (2001).
Drozdowski M., Dell Olmo P., "Scheduling Multiprocessor Tasks for Mean Flow Time Criterion", Computers and Operations Research 27, (2000), 571-585.
Bianco L., Blazewicz J., Dell Olmo P., Drozdowski M., "Preemptive Multiprocessor Tasks Scheduling with Release Times and Time Windows", Annals of Operations Research, 70, (1997), 43-55.
Bianco L., Dell Olmo P., Giordani S., Speranza M.G, "Minimizing Makespan in a Multimode Multiprocessor Shop Scheduling Problem", Naval Research Logistics 46, (1999), 893-911.
Dell Olmo P., Giordani S., Speranza M.G., "An Approximation Result for a Duo-Processor Task Scheduling Problem", Information Processing Letters, 61 (1997), 195-200.
Dror M., Kubiak W., Dell'Olmo P., "Scheduling Chains to Minimize Mean Flow Time", Information Processing Letters, 61 (1997), 297-301.
Bianco L., Blazewicz J., Dell'Olmo P., Drozdowski M., "Linear Algorithms for Preemptive Scheduling of Multiprocessor Tasks Subject to Minimal Lateness", Discrete Applied Mathematics, 72 (1997), 25-46.
Bianco L., Blazewicz J., Dell'Olmo P., Drozdowski M., "Scheduling UET Multiprocessor Tasks", Foundations of Computing and Decision Sciences, 19 (1994), 273-283.
Bianco L., Dell'Olmo P., Speranza M.G., "Nonpreemptive Scheduling of Independent Tasks with Prespecified Processor Allocations", Naval Research Logistics, 41 (1994), 959-971.
Bianco L., Blazewicz J., Dell'Olmo P., Drozdowski M., "Scheduling Preemptive Multiprocessor Tasks on Dedicated Processors", Performance Evaluation, 20 (1994), 361-371.
Bianco L., Blazewicz J., Dell'Olmo P., Drozdowski M., "Preemptive Scheduling of Multiprocessor Tasks on the Dedicated Processor System Subject to Minimal Lateness", Information Processing Letters, 46 (1993), 109-113.
Blazewicz J., Dell'Olmo P., Drozdowski M., Speranza M.G., "Scheduling Multiprocessor Tasks on Three Dedicated Processors", Information Processing Letters, 41 (1992), 275-280.
Transportation
Dell'Olmo, P., Mirchandani P.B., "A Model for Real-Time Traffic Coordination Using Simulation Based Optimization", in L. Bianco, P. Toth, (Editors), Advanced Methods in Transportation Analysis, Springer-Verlag, (1996), 525-546.
Dell'Olmo P., Mirchandani P.B., "REALBAND: An Approach for Real-Time Coordination of Traffic Flows on Networks", Transportation Research Record, 1494 (1995), 106-116.
Bianco L., Dell'Olmo P., Ezchekova I., "Application of Contextual Technology for Supporting Decision Making in Transportation", VII IFAC/IFORS Symposium on Transportation Systems: Theory and Application of Advanced Technology, Tianjin (Cina), IFAC (1994), 363-368.
Production and logistics
M.Caramia, P.Dell Olmo, M.Gentili, P.Mirchandi. Delivery Itineraries and Distribution Capacity of a Freight Network with Time Slots. Computer and Operations Reaserch, (in stampa).
Effective Resource Management in Manufacturing Systems, M. Caramia, P.Dell Olmo, Springer Book Series in Advenced Manufacturing, 2005.
Dell'Olmo, P., Lulli, G. "Planning activities in a network of logistic platforms with shared resources" (2004) Annals of Operations Research, 129 (1-4) 155-169
Bianco L., Dell'Olmo P., Speranza M.G., "Scheduling Independent Tasks with Multiple Shared Resources", in Optimization in Industry 3, John Wiley and Sons, (1995), 35-53.
Bielli M., Dell'Olmo P., "Flexibility of Scheduling Tools for Order Production Problems", Computer Integrated Manufacturing Systems, 6 (1993), 64-70.
Air Traffic Management
Bianco, Lucio; Dell'Olmo, Paolo; Giordani, Stefano, Scheduling models for air traffic control in terminal areas. Journal of Scheduling. 9 (2006), no. 3, 223--253.
Dell'Olmo P., Lulli G., "A New Hierarchical Architecture for Air Traffic Management: Optimization of Airway's Capacity in a Free Flight Scenario", European Journal of Operational Research, (2003), 179-193.
New Concepts and Methods in Air Traffic Management, L. Bianco, P. Dell'Olmo, A. Odoni (Eds.), Springer-Verlag (2001).
Modelling and Simulation in Air Traffic Management, L. Bianco, P. Dell'Olmo, A. Odoni (Eds.), Springer-Verlag (1997).
Bianco L., Dell'Olmo P., Giordani S., "Models and Algorithms for Real Time Control of Aircraft Landings", Operations Research Proceedings (1997), Springer-Verlag, 289-294.
Bianco L., Dell'Olmo P., Giordani S., "Dynamic algorithms for TMA traffic management", preprints of IFAC Symposium on Transportation Systems, M. Papageorgiou e A. Pouliezos Eds. (1997), 40-45
Bianco L., Dell'Olmo P., Giordani S., "Scheduling Models and Algorithms for TMA Traffic Management", in Modelling and Simulation in Air Traffic Management, L. Bianco, P. Dell'Olmo, A Odoni (Eds.) Springer-Verlag, (1997), 139-168.
Andreatta G., Brunetta L., Dell'Olmo P., "Valutazione della capacità di un terminal aereoportuale", in: S. Pallottino, A. Sciomachen (Eds), Scienza delle decisioni e trasporti, Franco Angeli (1999), 244-261.
Bianco L., Dell'Olmo P., Ricciardelli S., "Il controllo del traffico aereo", in: S. Pallottino, A. Sciomachen (Eds), Scienza delle decisioni e trasporti, Franco Angeli (1999), 284-305.
Routing
Confessore, G., Dell'Olmo, P., Gentili, M. Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem" (2005) Computers and Operations Research, 32 (9), 2383-2405.
Dell'Olmo, P., Gentili, M., Scozzari, A. "On finding dissimilar Pareto-optimal paths"European Journal of Operational Research, 162 (1), 70-82, (2005).
Bianco L., Dell Olmo P., Giordani S., "The Traveling Salesman Problem with Precedence Constraints and Binary costs", atti de XVII IFIP Conference on System Modelling and Optimization, Praga (Repubblica Ceca), J. Dolezal e J. Fidler (eds.), Chapman & Hall, (1996), 543-550.
Combinatorial Optimisation
Caramia, M., Dell Olmo, P., Embedding a Novel Objective Function in a Two-Phased Local Search for Robust Vertex Coloring , European Journal of Operational Research, 189 (2008), no. 3, 1358--1380.
Caramia, M., Dell Olmo, P., Coupling Stochastic and Deterministic Local Search in Examination Timetabling , Operations Research, 55, 351-366 (2007).
Caramia M., Dell'Olmo P., Italiano, G.F. "CHECKCOL: Improved Local Search for Graph Coloring", Journal of Discrete Algorithms, 4 (2006), no. 2, 277--298.
Dell'Olmo, P., Hansen, P., Pallottino, S., Storchi, G. "On uniform k-partition problems" (2005) Discrete Applied Mathematics, 150 (1-3), 121-139.
Caramia, M., Dell'Olmo, P. "Bounding vertex coloring by truncated multistage branch and bound" (2004) Networks, 44 (4), 231-242.
Caramia M., Dell'Olmo P., Italiano, G.F: "New Algorithms for Examination Timetabling", INFORMS Journal on Computing, (in stampa).
Caramia M., Dell'Olmo P., "Constraint Propagation in Graph Coloring", Journal of Heuristics 8 (2002), 83-107.
Confessore G., Dell'Olmo P., Giordani, S., "An Approximation Result for the Interval Coloring Problem on Claw-free Chordal Graphs", Discrete Applied Mathematics, (2002), 73-90.
Caramia M., Dell'Olmo P., "Solving the Minimum Integer Weighted Coloring Problem", Networks, 38 (2), 88-101 (2001).
Caramia M., Dell'Olmo P., "Iterative Coloring Extension of a Maximum Clique", Naval Research Logistics 48, (2001), 1-33.
Caramia M., Dell'Olmo P., "A Lower Bound on the Chromatic Number of Mycielski Graphs" Discrete Mathematics 235, (2001), 79-86.
Confessore G., Dell'Olmo P., Giordani, S., "An Approximation Result for a Periodic Allocation Problem", Discrete Applied Mathematics 112, (2001), 53-72
Confessore G., Dell'Olmo P., Giordani S., "A Linear Time Approximation Algorithm for Interval Coloring of Proper Interval", International Journal of Mathematical Algorithms 2, (2000), 133-147.
Dell Olmo P., Speranza M.G., "Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size, Discrete Applied Mathematics, 94 (1999), 181-191.
Bianco L., Dell Olmo P., Giordani S., "Flow Shop No-Wait Scheduling with Sequence Dependent Setup Times and Release Dates", Information Systems and Operational Research, Vol 37, n. 1, (1999), 3-19.
Bianco L., Dell Olmo P., Giordani S., "Minimizing Total Completion Time Subject to Release Dates and Sequence-Dependent Processing Times", Annals of Operations Research, 86 (1999), 393-415.
Bianco L., Dell Olmo P., Speranza M.G., "Heuristics for Multimode Scheduling Problems with Dedicated Resources", European Journal of Operational Research, 107 (1998), 260-271.
Dell Olmo P., Kellerer H., Speranza M.G., Tuza Zs., "A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins", Information Processing Letters, 65 (1998), 229-233.
Bianco L., Dell'Olmo P., Giordani S., "An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets", Computational Optimization and Applications, 8 (1997), 197-210.
Dell'Olmo P, Speranza M.G., Tuza Zs., "Efficiency and Effectiveness of Normal Schedules on Three Dedicated Processors", Discrete Mathematics, 164 (1997), 67-79.
Dell'Olmo P., Speranza M.G., Tuza Zs. "Comparability Graph Augmentation for some Multiprocessor Scheduling Problems", Discrete Applied Mathematics, 72 (1997), 71-84.
Dell'Olmo P., Speranza M.G., "Graph Models for Multiprocessor Scheduling Problems with Precedence Constraints", Foundations of Computing and Decision Sciences, 21 (1996), 17-29.
Bianco L., Dell'Olmo P., Speranza M.G., "Scheduling Independent Tasks with Multiple Modes", Discrete Applied Mathematics, 62 (1995), 35-50.
Bianco L., Blazewicz J., Dell'Olmo P., Drozdowski M., "Scheduling Multiprocessor Tasks on a Dynamic Configuration of Dedicated Processors", Annals of Operations Research 58 (1995), 493-517.
Rome
June 2013