Fabiana Ferrara (TRACS visitor, University of Lecce, Italy)

Branch-and-bound algorithm for set covering problems
Wednesday 14 May 2003 at 15.30, JCMB 6324

Abstract

In this talk, we present a branch-and-bound method, developed with sequential and parallel programs, for solving Set Covering problems. These problems are very difficult to solve through exact algorithms in the case of a large number of constraints and variables.

We describe the general approach and discuss differences between sequential and parallel implementations. We illustrate our findings with computational results.

Seminars by year

Current 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996