Algoritmi esatti per problemi combinatori difficili

Bin Packing e Cutting Stock

Algoritmi esatti per impacchettare oggetti in contenitori e per tagliare materiale: branch-price-and-cut, enumerazione di pattern e bound duali numericamente sicuri, comprese le varianti temporali e bidimensionali.

• Exact Algorithms for Two-Dimensional Knapsack Problems: A Unified Framework with New Benchmark Results
  INFORMS Journal on Computing, 2026
• A Numerically Exact Algorithm for the Bin-Packing Problem
  INFORMS Journal on Computing, 2024
• A Combinatorial Flow-based Formulation for Temporal Bin Packing Problems
  European Journal of Operational Research, 2023
• Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
  Optimization Letters, 2022

Problemi di Knapsack

Algoritmi esatti e di approssimazione per varianti dello zaino con setup, conflitti, prodotti e finestre temporali, insieme allo studio poliedrale delle disuguaglianze di cover.

• On the exact separation of cover inequalities of maximum-depth
  Optimization Letters, 2022
• A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
  European Journal of Operational Research, 2021
• Exact Approaches for the Knapsack Problem with Setups
  Computer & Operations Research, 2018
• On the Product Knapsack Problem
  Optimization Letters, 2018

Colorazione di Grafi

Branch-and-price e branch-and-bound basato su DSATUR per colorazione di vertici, pesata, per partizioni e a somma minima, comprese le riformulazioni come problemi di stable set di peso massimo.

• A Branch-and-Price Algorithm for the Minimum Sum Coloring Problem
  Discrete Applied Mathematics, 2021
• A note on selective line-graphs and partition colorings
  Operations Research Letters, 2019
• An Exact Algorithm for the Partition Coloring Problem
  Computer & Operations Research, 2018
• An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
  Networks, 2017

Clique e Stable Set

Algoritmi combinatori esatti per la clique massima e le sue varianti pesate sui vertici e sugli archi, con filtraggio SAT, bound superiori più stretti e decomposizioni in clique rilassate.

• Strength of the Upper Bounds for the Edge-Weighted Maximum Clique Problem
  Discrete Applied Mathematics, 2026
• CliSAT: a new exact algorithm for hard maximum clique problems
  European Journal of Operational Research, 2023
• A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
  INFORMS Journal on Computing, 2021
• A new branch-and-bound algorithm for the Maximum Weighted Clique Problem
  Computer & Operations Research, 2019

Interdizione, Blocker e Vertex Cut

Problemi bilivello e di interdizione sui grafi: vertex k-cut, separatori di vertici con capacità, interdizione di clique e di archi, blocker del flusso massimo.

• Integer linear programming formulations for the maximum flow blocker problem
  European Journal of Operational Research, 2025
• Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
  Operations Research, 2022
• A branch-and-cut algorithm for the Edge Interdiction Clique Problem
  European Journal of Operational Research, 2021
• On Integer and Bilevel Formulations for the k-Vertex Cut Problem
  Mathematical Programming Computation, 2020

Trasporti e Scheduling

Ottimizzazione nel traffico aereo e ferroviario: sequenziamento degli atterraggi, orari e instradamento dei treni, rotte di navi portacontainer fluviali.

• An Exact Approach for the Train Single-Routing Selection Problem
  European Journal of Operational Research, 2026
• Tighter MIP models for Barge Container Ship Routing
  Omega, 2019
• Approaches to a real-world train timetabling problem in a railway node
  Omega, 2016
• The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace
  Transportation Research Part B, 2016

Decomposizione e Riformulazione

Riformulazione automatica di Dantzig-Wolfe per programmi interi misti e rilassamenti perspective per problemi con variabili semicontinue.

• Improving the Approximated Projected Perspective Reformulation by Dual Information
  Operations Research Letters, 2017
• Approximated perspective relaxations: a project and lift approach
  Computational Optimization and Applications, 2016
• Automatic Dantzig-Wolfe Reformulation of Mixed Integer Programs
  Mathematical Programming, 2015

Covering, Localizzazione e Submodularità

Decomposizione di Benders per problemi di copertura e localizzazione su larghissima scala, e massimizzazione submodulare di utilità concave composte con un operatore di unione.

• Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
  Mathematical Programming, 2022
• Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Location Problems
  European Journal of Operational Research, 2019

Programmazione Quadratica Binaria

Tecniche di linearizzazione per problemi quadratici binari e QPLIB, la libreria di riferimento di istanze di programmazione quadratica.

• QPLIB: A Library of Quadratic Programming Instances
  Mathematical Programming Computation, 2019
• Theoretical and computational study of several linearisation techniques for Binary Quadratic Problems
  Annals of Operations Research, 2019