The Newton sums method in combinatorial optimization

DOI10.1515/DMA.1991.1.4.349MaRDI QIDQ4712351zbMATH OpenOpenAlexFDO

Authors Alexander 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

\(k\)-matchingassignmentcombinatorial optimizationsubexponential complexitytravelling salesmanweighted partition

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6191
• scientific article; zbMATH DE number 4158391
• scientific article; zbMATH DE number 4068626
• Solving combinatorial problems with combined min-max-min-sum objective and applications

Cited in

(7)

• Computation of exponential integrals
• The noising method: A new method for combinatorial optimization
• Combinatorial optimization with information geometry: the Newton method
• scientific article; zbMATH DE number 4158391 (Why is no real title available?)
• scientific article; zbMATH DE number 4068626 (Why is no real title available?)
• scientific article; zbMATH DE number 6191 (Why is no real title available?)
• A unified FFT-based approach to maximum assignment problems related to transitive finite group actions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4712351)