Home | News | Contacts

OptLab Group

• Members
• Alumni
• Papers, Proceedings, Reports
• Benchmarks
• Seminars
• Conference Organization

Research projects

• PRIN 2005: Routing and packing problems in the optimization of transportation systems
• PRIN 2008: Models and Algorithms for combinatorial optimization problems in the management of transportation systems
• Logistics
• Medical Emergency
• Aerospace applications
• Research and Technology Transfer: "doti di ricerca applicata" fundings

Prizes and Awards

• Prizes and awards granted to OptLab members

Teaching (in italian)

• Insegnamenti
• Proposte di Tesi
• Tesi e Premi
• Attività per le scuole

Benchmark

Here, we report the benchmarks used in our research work. For each set of instances, we refer to our paper in which the best results are obtained.

---

• Capacitated p-median instances and corresponding format, used in the papers
  • Ceselli A. "Two exact algorithms for the capacitated p-median problem", 4OR 1(4): 319-340 (2003)
  • Ceselli A., Righini G., "A branch and price algorithm for the capacitated p-median problem", Networks 45(3): 125-142 (2005)

  ---

• Instances and results for a Two level capacitated facility location problem , used in the papers
  • Addis B., Carello G., Ceselli A. "Exactly solving a Two-level Hierarchical Location Problem with modular node capacities", Optimization Online, , submitted to Networks
  • Addis B., Carello G., Ceselli A. "Neighborhood based heuristics for a Two-level Hierarchical Location Problem with modular node capacities", under way.

  ---

• Instances and results for the Max Edge Weighted Clique Problem with Multiple Choice Constraints , used in the paper
  • Ceselli A., Cordone C., Melzani Y., Righini G., Mathematical programming algorithms for the Max Edge Weighted Clique Problem with Multiple Choice Constraints, CTW IX, Cologne, May 2010.
• Instances for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization used in the paper
  • R. Cordone, P. Hosteins and G. Righini ``A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization'', Journal on Computing (2017)

---