@TechReport{	  it:2002-030,
  author	= {Henrik Bj{\"o}rklund and Sven Sandberg and Sergei
		  Vorobyov},
  title		= {An Experimental Study of Algorithms for Completely
		  Unimodal Optimization},
  institution	= {Department of Information Technology, Uppsala University},
  department	= {Computing Science Division},
  year		= {2002},
  number	= {2002-030},
  month		= oct,
  abstract	= {The paper presents an account of the experimental study of
		  five different algorithms for the Completely Unimodal
		  Pseudoboolean Function (CUPBF) Optimization. CUPBFs satisfy
		  the Hirsch's conjecture, but are not known (although
		  conjectured) to be polynomial. We summarize known and new
		  upper and lower bounds, describe methods of random CUPBFs
		  generation, and use them to compare the algorithms. }
}