We present a way of exploiting partial separability in particular global optimization problems. The aim is to reduce significantly the dimension of the search space. The procedure relies on graph theory tools such as graph partitioning with node separators. We illustrate the idea on a distance geometry problem which arise in the interpretation of nuclear magnetic resonance data and in the determination of protein structures.
Current 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996