Publication Date:
2014-02-26
Description:
The concept of L##-convexity is introduced by Fujishige--Murota (2000) as a discrete convexity for functions defined over the integer lattice. The main aim of this note is to understand the difference of the two algorithms for L##-convex function minimization: Murota's steepest descent algorithm (2003) and Kolmogorov's primal algorithm (2005).
Keywords:
ddc:000
Language:
English
Type:
reportzib
,
doc-type:preprint
Format:
application/pdf
Format:
application/postscript