ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers on Graphs.
Han LuZenan LiRunzhong WangQibing RenXijun LiMingxuan YuanJia ZengXiaokang YangJunchi YanPublished in: ICLR (2023)
Keyphrases
- combinatorial optimization
- graph theory
- combinatorial optimization problems
- metaheuristic
- simulated annealing
- optimization problems
- traveling salesman problem
- combinatorial search
- mathematical programming
- branch and bound
- branch and bound algorithm
- graph matching
- combinatorial problems
- sat solvers
- quadratic assignment problem
- exact algorithms
- hard combinatorial optimization problems
- vehicle routing problem
- directed graph
- evolutionary algorithm
- neural network
- graph model
- graph databases
- graph mining
- memetic algorithm
- single machine scheduling problem
- path relinking
- subgraph isomorphism
- search algorithm