@inproceedings{0d5245548c7c4bbdb9765b119ec85312,
title = "Continuous Reformulation of Binary Variables, Revisited",
abstract = "We discuss a class of tightly feasible MILP for which branch-and-bound is ineffective. We consider its hardness, evaluate the probability that randomly generated instances are feasible, and introduce a heuristic solution method based on the old idea of reformulating binary variables to continuous while introducing a linear complementarity constraint. We show the extent of the computational advantage, under a time limit, of our heuristic with respect to a state-of-the-art branch-and-bound implementation.",
keywords = "Hard instances, Infeasible, Market share, Market split, Reformulation",
author = "Leo Liberti",
note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 20th International Conference on Mathematical Optimization Theory and Operations Research , MOTOR 2021 ; Conference date: 05-07-2021 Through 10-07-2021",
year = "2021",
month = jan,
day = "1",
doi = "10.1007/978-3-030-86433-0\_14",
language = "English",
isbn = "9783030864323",
series = "Communications in Computer and Information Science",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "201--215",
editor = "Alexander Strekalovsky and Yury Kochetov and Tatiana Gruzdeva and Andrei Orlov",
booktitle = "Mathematical Optimization Theory and Operations Research",
}