5
Nov
Name: Osman Oguz
University: Bilkent University
Date: Friday, November 9, 2007
Time: 1:30 to 3:00 pm
Location: 388 Posner Hall
Title: Cardinality Cuts: New Universal Cutting Planes for Integer Programming
Abstract:
We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. The differences exist in three aspects. The first is in the generation of the inequalities. The method used in generation of the new cuts involves solving linear programs only. Second difference is the more general applicability, i.e., being useful for problems like TSP and general integer programming problems. The third aspect is superior effectiveness as indicated by the computational experiments.
