Solving the Bi-criteria Max-Cut Problem with Different Neighborhood Combination Strategies.

Li-Yuan Xue Rong-Qiang Zeng Zheng-Yin Hu Yi Wen

Published in: IDEAL (2017)

Keyphrases

bicriteria
efficient solutions
integer linear programming
knapsack problem
location problems
np complete problems
max cut
computational complexity
combinatorial optimization
greedy algorithm
flowshop
random graphs
cross entropy