Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries.
Naveen GargRohit KhandekarPublished in: ESA (2004)
Keyphrases
- upper bound
- lower bound
- quadratic programming problems
- upper and lower bounds
- branch and bound algorithm
- variable ordering
- positive and negative
- constraint problems
- efficiently computable
- tight bounds
- worst case
- branch and bound
- finite domain
- special case
- lower and upper bounds
- linear functions
- combinatorial optimization
- upper bounding
- sample size
- hurst exponent