We present a computer program that helps the user discovering new families of valid inequalities for any integer program. It does so by finding simple valid inequalities that are violated by a fractional solution supplied by the user. It is up to the user to generalize these inequalities further. We present new families of inequalities for the capacitated vehicle routing problem and the traveling salesman problem with pickup and deliveries found using the program.
|Publication status||Published - 2009|
|Event||20th International Symposium of Mathematical Programming - Chicago, IL, United States|
Duration: 23 Aug 2009 → 28 Aug 2009
Conference number: 20
|Conference||20th International Symposium of Mathematical Programming|
|Period||23/08/2009 → 28/08/2009|