When designing a branch-and-cut method for a specic problem class it is important to know classes of valid inequalities for the problem. We present a computer program that helps the user discovering new families of valid inequalities. It does so by finnding simple valid inequalities that are violated by a fractional solution supplied by the user. It is up to the user to generalize these examples further. We will present examples of 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||23rd European Conference on Operational Research - Bonn, Germany|
Duration: 5 Jul 2009 → 8 Jul 2009
Conference number: 23
|Conference||23rd European Conference on Operational Research|
|Period||05/07/2009 → 08/07/2009|