A new Lagrangian net algorithm for solving max-bisection problems.
Fengmin XuXusheng MaBaili ChenPublished in: J. Comput. Appl. Math. (2011)
Keyphrases
- optimal solution
- combinatorial optimization
- linear programming problems
- worst case
- learning algorithm
- optimization algorithm
- np complete
- combinatorial optimisation
- solving problems
- simulated annealing
- cost function
- objective function
- k means
- detection algorithm
- gradient projection
- partial solutions
- search algorithm for solving
- quadratic programming
- nonlinear optimization problems
- exact solution
- segmentation algorithm
- linear programming
- probabilistic model
- np hard
- search space
- lower bound