Learning to select cuts for efficient mixed-integer programming

•We propose an efficient and generalizable learning based cut selection policy for tackling combinatorial optimization problems.•We present a novel cut ranking formulation in the context of multiple instance learning.•Experiments demonstrate that cut ranking is superior to other manual heuristics an...

Full description

Bibliographic Details

Published in:	Pattern recognition Vol. 123; p. 108353
Main Authors:	Huang, Zeren, Wang, Kerong, Liu, Furui, Zhen, Hui-Ling, Zhang, Weinan, Yuan, Mingxuan, Hao, Jianye, Yu, Yong, Wang, Jun
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.03.2022
Subjects:	Cutting plane Generalization ability Mixed-Integer programming Multiple instance learning Mixed-Integer programming Cutting plane Multiple instance learning Generalization ability
ISSN:	0031-3203, 1873-5142
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!