A Randomized Algorithm to Optimize Over Certain Convex Sets

DOI10.1287/moor.20.3.529zbMath0845.90094OpenAlexW2132799190WikidataQ56603368 ScholiaQ56603368MaRDI QIDQ4864870

John A. Mount, Sridhar R. Tayur, Ravindran Kannan

Publication date: 16 September 1996

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.20.3.529

zbMATH Keywords

randomized polynomial time algorithmcomponent commonality problem

Mathematics Subject Classification ID

Convex programming (90C25) Stochastic programming (90C15)

Related Items

An algebraic geometry algorithm for scheduling in presence of setups and correlated demands