Accumulating Jacobians as chained sparse matrix products
From MaRDI portal
Publication:1396835
DOI10.1007/s10107-002-0329-7zbMath1023.90053WikidataQ57389652 ScholiaQ57389652MaRDI QIDQ1396835
Publication date: 13 July 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0329-7
dynamic programming; combinatorial optimization; Jacobians; chained sparse matrix products; edge elimination in computational graphs
Related Items
Uses Software