Cutting plane algorithms for solving a stochastic edge-partition problem

  • Authors:

  • Z. Caner TaşKıN;J. Cole Smith;Shabbir Ahmed;Andrew J. Schaefer

  • Affiliations:

  • Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA;Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA;School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30032, USA;Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, PA 15261, USA

  • Venue:
  • Discrete Optimization
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the edge-partition problem, which is a graph theoretic problem arising in the design of Synchronous Optical Networks. The deterministic edge-partition problem considers an undirected graph with weighted edges, and simultaneously assigns nodes and edges to subgraphs such that each edge appears in exactly one subgraph, and such that no edge is assigned to a subgraph unless both of its incident nodes are also assigned to that subgraph. Additionally, there are limitations on the number of nodes and on the sum of edge weights that can be assigned to each subgraph. In this paper, we consider a stochastic version of the edge-partition problem in which we assign nodes to subgraphs in a first stage, realize a set of edge weights from a finite set of alternatives, and then assign edges to subgraphs. We first prescribe a two-stage cutting plane approach with integer variables in both stages, and examine computational difficulties associated with the proposed cutting planes. As an alternative, we prescribe a hybrid integer programming/constraint programming algorithm capable of solving a suite of test instances within practical computational limits.