Lower bounds on the maximum number of non-crossing acyclic graphs.
Clemens HuemerAnna de MierPublished in: Eur. J. Comb. (2015)
Keyphrases
- maximum number
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- objective function
- np hard
- worst case
- upper and lower bounds
- lower and upper bounds
- optimal solution
- quadratic assignment problem
- lower bounding
- vc dimension
- multi dimensional
- lagrangian relaxation
- optimal cost
- set of randomly generated instances
- integer programming
- online learning
- scheduling problem
- linear programming relaxation
- randomly generated problems
- polynomial approximation