wiki:CglResidualCapacity

CglResidualCapacity

Contributor: Francisco Barahona
Maintainer: Francisco Barahona, barahon@…

Introduction

This is an implementation of a separation algorithm for Residual Capacity Inequalities. They have been introduced in T. L. Magnanti, P. Mirchandani, and R. Vachani, "The convex hull of two core capacitated network design problems," Math. Programming, 60 (1993), pp. 233-250. The separation algorithm was given in A. Atamturk and D. Rajan, "On splittable and unsplittable flow capacitated network design arc-set polyhedra," Math. Program., 92 (2002), pp. 315-333.

These inequalities are particularly useful for Network Design and Capacity Planning models. See the documentation below for a description of them.

Papers, Presentations, and References


Documentation and Bug Reports

See the section "Project Links" on the Cgl main Trac page.

Last modified 12 years ago Last modified on Nov 18, 2006 12:33:55 PM

Attachments (1)

Download all attachments as: .zip