Ashutosh’s talk on March 17 is on corner polyhedra and valid inequalities generated
using these. The talk is based on paper by Gomory et al Corner Polyhedra and their connection with cutting planes”. An interesting essay explaining these The atoms of integer programming explains the importance of these polyhedra in layman’s language.
On March 24, Menal will talk on algorithms for counting number of feasible solutions for integer programs. These algorithms run in time polynomial in the size of input if the dimension is fixed. These can, as a special case, also be used to find a feasible solution. This talk is based on, among others, a paper by Barvinok and Pommersheim and one by Loera et al.
Today, Ying will take us on a ride through a road called A Stochastic Programming Duality Approach to
Inventory Centralization Games. The talk is based on recent papers by Chen and Zhang. Fasten your seat-belts before the talk begins. There are no slides as Ying slugs it out on the blackboard. You missed it if you were not there.
Today Zeliha will talk about different VRP formulations and how they are related to each other. This talk is based on a paper by Letchford and Gonzalez.
Jim Ostrowski will present on a new way to solve LPs on January 28th. The presentation slides are not available.
Udom’s talk on Feb 18th is based on a recent paper
On Robust Optimization of Two-Stage Systems by Takriti and Ahmed. It is shown that in general, a robust solution may have higher cost than that obtained by a 2-stage model. The presentation is available as a PDF.
Today (Feb 25), Scott DeNegre will talk on the the Windy Postman Problem, based on a paper by Corberan, Plana, Reinelt, J.M. Sanchis and D. Theis. Slides will be available here.
Cagri presents concepts integrating global optimization and semidefinite programming on January 24th. The talk is based on work of Sherali and Fraticelli.
Camilo Mancilla presents a tutorial on the cross entropy method on 11th Feb. The method can be used to heuristically generate good solutions for many combinatorial problems. The talk is based on a tutorial by Boer, Kroese, Mannor and Rubinstein and is attached as a PDF file
The talk will be based on Chvatal’s paper on using resolution search to solve binary programs (PDF). Even though worst case performance of resolution based proofs (as given by DP) is worse than that of DPLL-based procedures, it can work very well for most structured programs (like those encountered in real life).
There does not seem to be a way to upload presentation-PDFs, so here is a link to this presentation.