Lower and Upper Bounds for the Discrete Bi-Directional Preemptive Conversion Problem with a Constant Price Interval.
Michael SchwarzPublished in: Algorithms (2020)
Keyphrases
- bi directional
- lower and upper bounds
- lower bound
- upper bound
- global exponential stability
- upper and lower bounds
- lagrangian relaxation
- np hard
- branch and bound algorithm
- optimal solution
- branch and bound
- scheduling problem
- associative memory
- valid inequalities
- english chinese
- search algorithm
- linear programming
- special case
- cutting plane
- data sets