GRASP with Path Relinking for the SumCut Problem
This paper proposes a GRASP algorithm combined with Path Relinking to solve the SumCut minimization problem. In the SumCut problem one is given a graph with n nodes and must label the nodes in a way that each node receives a unique label from the set{1, 2,..., n}, in order to minimize the sum cut of...
সংরক্ষণ করুন:
| প্রকাশিত: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| প্রধান লেখক: | , |
| বিন্যাস: | Artigo |
| ভাষা: | Inglês |
| প্রকাশিত: |
International Journal of Combinatorial Optimization Problems and Informatics
2012
|
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | https://www.redalyc.org/articulo.oa?id=265224466002 |
| ট্যাগগুলো: |
কোনো ট্যাগ নেই, প্রথমজন হিসাবে ট্যাগ করুন!
|