返回
Preprocessing and cutting planes with conflict graphs
DOI:10.1016/j.cor.2020.105176.png)
摘要
En 中文
This paper addresses the development of conflict graph-based algorithms and data structures into the COIN-OR Branch-and-Cut (CBC) solver, including: (i) an efficient infrastructure for the construction and manipulation of conflict graphs; (ii) a preprocessing routine based on a clique strengthening scheme that can both reduce the number of constraints and produce stronger formulations; (iii) a clique cut separator capable of obtaining dual bounds at the root node LP relaxation that are 19.65% stronger than those provided by the equivalent cut generator of a state-of-the-art commercial solver, 3.62 times better than those attained by the clique cut separator of the GLPK solver and 4.22 times stronger than the dual bounds obtained by the clique separation routine of the COIN-OR Cut Generation Library; and (iv) an odd-cycle cut separator with a new lifting module to produce valid odd-wheel inequalities. The average gap closed by this new version of CBC was up to four times better than its previous version. Moreover, the number of mixed-integer programs solved by CBC in a time limit of three hours was increased by 23.53%. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Mixed-integer linear programming
Conflict graphs
Preprocessing
Cutting planes
Clique inequalities
Odd-cycle inequalities
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Erratum to: Orthorexia nervosa and self-attitudinal aspects of body image in female and male university students勘误:神经性正食症与女性和男性大学生身体意象的自我态度方面
Recovery of salinity gradient energy in desalination plants by reverse electrodialysis
Desalination
IF0
Perceptions of Powdered Alcohol and Intentions to Use: An Exploratory Qualitative Assessment of Potential Palcohol Use by Young Adults
Beverages
IF0

