Upper Bounds on Boolean-Width with Applications to Exact Algorithms.
Yuri RabinovichJan Arne TelleMartin VatshellePublished in: IPEC (2013)
Keyphrases
- exact algorithms
- upper bound
- lower bound
- exact solution
- approximation algorithms
- knapsack problem
- max sat
- worst case
- upper and lower bounds
- branch and bound algorithm
- boolean functions
- computational problems
- branch and bound
- lower and upper bounds
- benders decomposition
- vehicle routing problem with time windows
- heuristic methods
- combinatorial optimization problems
- combinatorial optimization
- np hard
- combinatorial problems
- tight upper and lower bounds
- sample complexity
- efficiently computable
- traveling salesman problem
- greedy algorithm
- cellular automata
- linear programming
- neural network