Taking the human out of decomposition-based optimization via artificial intelligence: Part I. Learning when to decompose
원문 초록
In this paper, we propose a graph classification approach for automatically determining whether to use a monolithic or a decomposition-based solution method. In this approach, an optimization problem is represented as a graph that captures the structural and functional coupling among the variables and constraints of the problem via an appropriate set of features. Given this representation, a graph classifier is built to determine the best solution method for a given problem. The proposed approach is used to develop a classifier that determines whether a convex Mixed Integer Nonlinear Programming problem should be solved using branch and bound or the outer approximation algorithm. Finally, it is shown how the learned classifier can be incorporated into existing mixed integer optimization solvers.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Density-aware Walks for Coordinated Campaign Detection
Positional Encoding meets Persistent Homology on Graphs
Improving the Effective Receptive Field of Message-Passing Neural Networks
Graph Style Transfer for Counterfactual Explainability
Scalable Graph Generative Modeling via Substructure Sequences
Addressing the Scarcity of Benchmarks for Graph XAI
토론
이 논문과 연결된 포럼 글이 아직 없습니다.