Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees.
Dima GrigorievMarek KarpinskiNicolai N. Vorobjov Jr.Published in: Discret. Comput. Geom. (1997)
Keyphrases
- lower bound
- upper bound
- decision making
- decision makers
- decision trees
- np hard
- branch and bound algorithm
- branch and bound
- worst case
- decision rules
- linear algebra
- decision problems
- tree structure
- scheduling problem
- decision theory
- linear programming relaxation
- tree construction
- data sets
- optimal solution
- column generation
- lagrangian relaxation
- objective function
- lower bounding