Constraint Programming Techniques for Mixed Integer Linear Programs (2009)
Many decision problems in industry, logistics, and telecommunications can be viewed as satisfiability or optimization problems. Two paradigms have reached a high degree of sophistication from the...
Minimal Infeasible Subsystems and Benders cuts (2008)
Matteo Fischetti, Domenico Salvagnin, Arrigo Zanette
There are many situations in mathematical programming where cutting planes can be generated by solving a certain “cut generation linear program ” whose feasible solutions define a family of valid...
A Local Dominance Procedure for Mixed-Integer Linear Programming (2007)
Matteo Fischetti, Domenico Salvagnin
Among the hardest Mixed-Integer Linear Programming (MILP) problems, the ones that exhibit a symmetric nature are particularly important in practice, as they arise in both theoretical and practical...
10. Fast Approaches to Robust Railway Timetabling (2007)
Fischetti, Matteo, Zanette, Arrigo, Salvagnin, Domenico
The Train Timetabling Problem (TTP) consists in finding a train schedule on a railway network that satisfies some operational constraints and maximizes some profit function which counts for the...