A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem.
Gintaras PalubeckisPublished in: Appl. Math. Comput. (2009)
Keyphrases
- preprocessing
- times faster
- theoretical analysis
- dynamic programming
- computational cost
- computationally efficient
- learning algorithm
- linear programming
- high accuracy
- iterative procedure
- experimental evaluation
- tree structure
- optimization algorithm
- search procedure
- recursive algorithm
- graph based algorithm
- particle swarm optimization
- worst case
- k means
- search space
- expectation maximization
- clustering method
- upper bound
- path planning
- probabilistic model
- convergence rate
- recognition algorithm
- evolutionary algorithm
- similarity measure