How tight is the corner relaxation? Insights gained from the stable set problem.
Discrete Optimization(2012)
摘要
The corner relaxation of a mixed-integer linear program is a central concept in cutting plane theory. In a recent paper Fischetti and Monaci provide an empirical assessment of the strength of the corner and other related relaxations on benchmark problems. In this paper we give a precise characterization of the bounds given by these relaxations for the edge formulation of the maximum stable set problem in a graph.
更多查看译文
关键词
Stable set,Corner relaxation,Cutting planes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络