The Newton sums method in combinatorial optimization

DOI10.1515/dma.1991.1.4.349zbMath0776.90062OpenAlexW2029933461MaRDI QIDQ4712351

Alexander I. Barvinok

Publication date: 25 June 1992

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1991.1.4.349

zbMATH Keywords

combinatorial optimizationtravelling salesmanassignment\(k\)-matchingweighted partitionsubexponential complexity

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (1)

Computation of exponential integrals

This page was built for publication: The Newton sums method in combinatorial optimization