Optimization Online


Stabilized Benders methods for large-scale combinatorial optimization, with application to data privacy

Daniel Baena (danibaena***at***gmail.com)
Jordi Castro (jordi.castro***at***upc.edu)
Antonio Frangioni (frangio***at***di.unipi.it)

Abstract: The Cell Suppression Problem (CSP) is a challenging Mixed-Integer Linear Problem arising in statistical tabular data protection. Medium sized instances of CSP involve thousands of binary variables and million of continuous variables and constraints. However, CSP has the typical structure that allows application of the renowned Benders' decomposition method: once the ``complicating'' binary variables are fixed, the problem decomposes into a large set of linear subproblems on the ``easy'' continuous ones. This allows to project away the easy variables, reducing to a master problem in the complicating ones where the value functions of the subproblems are approximated with the standard cutting-plane approach. Hence, Benders' decomposition suffers from the same drawbacks of the cutting-plane method, i.e., oscillation and slow convergence, compounded with the fact that the master problem is combinatorial. To overcome this drawback we present a stabilized Benders decomposition whose master is restricted to a neighborhood of successful candidates by local branching constraints, which are dynamically adjusted, and even dropped, during the iterations. Our experiments with randomly generated and real-world CSP instances with up to 3600 binary variables, 90M continuous variables and 15M inequality constraints show that our approach is competitive with both the current state-of-the-art (cutting-plane-based) code for cell suppression, and the Benders implementation in CPLEX 12.7. In some instances, stabilized Benders is able to quickly provide a very good solution in less than one minute, while the other approaches were not able to find any feasible solution in one hour.

Keywords: Benders' decomposition; Mixed-Integer Linear Problems; stabilization; local branching; large-scale optimization; statistical tabular data protection; cell suppression problem

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

Category 2: Integer Programming (Cutting Plane Approaches )

Category 3: Applications -- OR and Management Sciences

Citation: D. Baena, J. Castro, A. Frangioni, Stabilized Benders methods for large-scale combinatorial optimization, with application to data privacy, Research Report DR 2017/03, Dept. of Statistics and Operations Research, Universitat Politècnica de Catalunya, Barcelona, 2017.

Download: [PDF]

Entry Submitted: 10/17/2017
Entry Accepted: 10/17/2017
Entry Last Modified: 10/17/2017

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