Analysis of randomised rounding for integer programs

DOI10.1163/1569392043272485zbMATH Open1106.90053OpenAlexW4234114444MaRDI QIDQ3409852FDOQ3409852

Authors: Armen S. Asratian, N. N. Kuzyurin 

Publication date: 20 November 2006

Full work available at URL: https://doi.org/10.1163/1569392043272485

Recommendations

• Improved Approximation Guarantees for Packing and Covering Integer Programs
• STACS 2005
• Approximation of optima of integer programs of the packing—covering type
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Randomized metarounding

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10)

Cited In (4)

• A rounding algorithm for integer programs
• A feasible rounding approach for mixed-integer optimization problems
• Optimization of portfolio compositions for small and medium price-taking traders
• Investigation of solutions of randomly generated integer programming problems with 0-1 variables

This page was built for publication: Analysis of randomised rounding for integer programs

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