Theory and Applications of n-Fold Integer Programming

DOI10.1007/978-1-4614-1927-3_20zbMath1242.90113arXiv0911.4191OpenAlexW1829416734MaRDI QIDQ2897311

Shmuel Onn

Publication date: 10 July 2012

Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)

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

zbMATH Keywords

integer programmingcombinatorial optimizationnonlinear optimizationtransportation problemdiscrete optimizationdata securitymultiway tablegraver complexitygraver basemul-ticommodity flowprivacy in databases

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Linear programming (90C05)

Related Items (3)

Higher-dimensional sieving for the number field sieve algorithms ⋮ Efficient solutions for weight-balanced partitioning problems ⋮ Graver basis and proximity techniques for block-structured separable convex integer minimization problems

This page was built for publication: Theory and Applications of n-Fold Integer Programming