Imre Pólik

Imre Pólik

Auto-generated profile, based on publicly available information

Imre Pólik

Fair Isaac Corporation

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 January 2010
Verified
Book Chapter
Closed access
PDF file
IPImre Pólik
Imre Pólik
Tamás Sándor TerlakyTamás Sándor Terlaky
Tamás Sándor Terlaky


6 October 2026
Verified
Book Chapter
Closed access
PDF file
TBTimo Berthold
Timo Berthold
DKDominik Kamp
Dominik Kamp
GMGioni Mexi
Gioni Mexi
SPSebastian Pokutta
Sebastian Pokutta
IPImre Pólik
Imre Pólik

5 September 2017 in arXiv
Verified
Preprint
Open access
PDF file
PCPhilipp M. Christophel
Philipp M. Christophel
IPImre Pólik
Imre Pólik
We present a new branch-and-bound type search method for mixed integer linear optimization problems based on the concept of offshoots (introduced in this paper). While similar to a classic branch-and-bound method, it allows for changing the order of the variables in a dive (shaping) and removing unnecessary branching variables from a dive (trimming). The regular branch-and-bound algorithm can be seen as a special case of our new method. We also discuss extensions to our new method such as choosing to branch from the top or the bottom of an offshoot. We present several numerical experiments to give a first impression of the potential of our new method.