Optimization Online


A note on sequential pairing cut-generating procedure

Manish Bansal (manish.bansal***at***northwestern.edu)

Abstract: In this paper, we prove that the sequential pairing cut-generating procedure of Guan et al. (2007) generalizes a special case of the mingled continuous multi-mixing cut-generating procedure.

Keywords: Sequential pairing; cut-generating procedure; mingling; mingled continuous multi-mixing; mixed integer rounding;

Category 1: Integer Programming ((Mixed) Integer Linear Programming )

Category 2: Integer Programming (Cutting Plane Approaches )

Citation: Technical Report - MB2, Northwestern University, 10/2015


Entry Submitted: 10/08/2015
Entry Accepted: 10/08/2015
Entry Last Modified: 10/14/2015

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society