2 search results - page 1 / 1 » The three column Bandpass problem is solvable in linear time |
TCS
2011
13 years 8 days ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
ORL
2006
13 years 5 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...