7245 2019 eng 385 398 11480 conferenceobject 0 -- -- -- Given a factorable function f, we propose a procedure that constructs a concave underestimor of f that is tight at a given point. These underestimators can be used to generate intersection cuts. A peculiarity of these underestimators is that they do not rely on a bounded domain. We propose a strengthening procedure for the intersection cuts that exploits the bounds of the domain. Finally, we propose an extension of monoidal strengthening to take advantage of the integrality of the non-basic variables. A. Lodi, V. Nagarajan (eds), Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019 10.1007/978-3-030-17953-3_29 yes 2019-01-16 urn:nbn:de:0297-zib-71105 LNCS Franziska Schlösser Felipe Serrano Mathematical Optimization Mathematical Optimization Methods MIP-ZIBOPT MODAL-SynLab MODAL-Gesamt Applied Optimization