Partial convexification cuts for 0-1 mixed-integer programs

Hanif D. Sherali, Youngho Lee, Youngjin Kim

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)

Abstract

In this research, we propose a new cut generation scheme based on constructing a partial convex hull representation for a given 0-1 mixed-integer programming problem by using the reformulation-linearization technique (RLT). We derive a separation problem that projects the extended space of the RLT formulation into the original space, in order to generate a cut that deletes a current fractional solution. Naturally, the success of such a partial convexification based cutting plane scheme depends on the process used to tradeoff the strength of the cut derived and the effort expended. Accordingly, we investigate several variable selection rules for performing this convexification, along with restricted versions of the accompanying separation problems, so as to be able to derive strong cuts within a reasonable effort. We also develop a strengthening procedure that enhances the generated cut by considering the binariness of the remaining unselected 0-1 variables. Finally, we present some promising computational results that provide insights into implementing the proposed cutting plane methodology.

Original languageEnglish
Pages (from-to)625-648
Number of pages24
JournalEuropean Journal of Operational Research
Volume165
Issue number3
DOIs
Publication statusPublished - 2005 Sep 16

Keywords

  • Branch-and-cut
  • Convexification cut
  • Cutting plane
  • Integer programming
  • Reformulation-linearization technique (RLT)

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Fingerprint Dive into the research topics of 'Partial convexification cuts for 0-1 mixed-integer programs'. Together they form a unique fingerprint.

Cite this