Sciweavers

48 search results - page 5 / 10
» disopt 2008
Sort
View
DISOPT
2007
90views more  DISOPT 2007»
13 years 8 months ago
On the job rotation problem
The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, find a k × k principal submatrix of A whose optimal assignment problem...
Peter Butkovic, Seth Lewis
DISOPT
2007
94views more  DISOPT 2007»
13 years 8 months ago
Using mixed-integer programming to solve power grid blackout problems
We consider optimization problems related to the prevention of large-scale cascading blackouts in power transmission networks subject to multiple scenarios of externally caused da...
Daniel Bienstock, Sara Mattia
DISOPT
2008
59views more  DISOPT 2008»
13 years 8 months ago
More on online bin packing with two item sizes
We follow the work of [7] and study the online bin packing problem, where every item has one of two possible sizes which are known in advance. We focus on the parametric case, whe...
Leah Epstein, Asaf Levin
DISOPT
2008
99views more  DISOPT 2008»
13 years 8 months ago
Computing robust basestock levels
This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decom...
Daniel Bienstock, Nuri Özbay
DISOPT
2008
66views more  DISOPT 2008»
13 years 8 months ago
Worst case examples of an exterior point algorithm for the assignment problem
An efficient exterior point simplex type algorithm for the assignment problem has been developed by Paparrizos [K. Paparrizos, An infeasible (exterior point) simplex algorithm for...
Charalampos Papamanthou, Konstantinos Paparrizos, ...