Abstract
We consider a class of discrete bottleneck problems which includes bottleneck integral flow problems. It is demonstrated that a problem in this class, with k discrete variables, can be optimized by solving atmost k problems with real valued variables.
Original language | English |
---|---|
Pages (from-to) | 299-302 |
Number of pages | 4 |
Journal | Discrete Applied Mathematics |
Volume | 4 |
Issue number | 4 |
DOIs | |
State | Published - Aug 1982 |