Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming

DOI10.1109/TIT.2015.2466598zbMath1359.90117arXiv1302.3518OpenAlexW2964095188MaRDI QIDQ2977210

Nissim Halabi, Guy Even

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.3518

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (1)

Convergence and correctness of belief propagation for the Chinese postman problem

This page was built for publication: Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming