A lower bound for the mixed μ problem.
Peter Michael YoungJohn DoylePublished in: IEEE Trans. Autom. Control. (1997)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- np hard
- optimal solution
- objective function
- lower and upper bounds
- case study
- worst case
- linear programming relaxation
- neural network
- randomized algorithm
- lower bounding
- website
- real world
- theoretical analysis
- upper and lower bounds
- lagrangian relaxation
- information retrieval
- competitive ratio
- data sets
- sufficiently accurate