Three Topics in Mixed Integer Programming (2009)
In chapter entitled "Lexicography and degeneracy: Can a pure cutting plane algorithm work?", we discuss an implementation of the lexicographic version of Gomory's fractional cutting plane method for...
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...
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...