52 citations · 216 across the 27 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013★ 11 cited
Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming
Daniel Bienstock, Jay Sethuraman, Chun Ye
In the incremental knapsack problem ($\IK$), we are given a knapsack whose capacity grows weakly as a function of time. There is a time horizon of periods and the capacity of t…
math.OC2013★ 5 cited
Synchronization-Aware and Algorithm-Efficient Chance Constrained Optimal Power Flow
Russell Bent, Daniel Bienstock, Michael Chertkov
One of the most common control decisions faced by power system operators is the question of how to dispatch generation to meet demand for power. This is a complex optimization prob…