On polynomial complexity of a stochastic algorithm for mixed zero-one programs.

DOI10.1016/S0166-218X(03)00301-9zbMath1043.90056OpenAlexW2049573696MaRDI QIDQ1421463

Raj Jagannathan

Publication date: 26 January 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00301-9

zbMATH Keywords

Probabilistic analysisCentral limit theoremPolynomial timeMixed zero-one programRandomization method

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

• A new polynomial-time algorithm for linear programming
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• The multivariate normal distribution
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On polynomial complexity of a stochastic algorithm for mixed zero-one programs.