-

 

 

 




Optimization Online





 

Network Design Arc Set with Variable Upper Bounds

Alper Atamturk (atamturk***at***ieor.berkeley.edu)
Oktay Gunluk (oktay***at***watson.ibm.com)

Abstract: In this paper we study the network design arc set with variable upper bounds. This set appears as a common substructure of many network design problems and is a relaxation of several fundamental mixed-integer sets studied earlier independently. In particular, the splittable flow arc set, the unsplittable flow arc set, the single node fixed-charge flow set, and the binary knapsack set are facial restrictions of the network design arc set with variable upper bounds. Here we describe families of strong valid inequalities that cut off all fractional extreme points of the continuous relaxation of the network design arc set with variable upper bounds. Interestingly, some of these inequalities are also new even for the aforementioned restrictions studied earlier.

Keywords:

Category 1: Integer Programming

Citation: Networks 50, 17-28, 2007

Download:

Entry Submitted: 05/01/2005
Entry Accepted: 05/01/2005
Entry Last Modified: 04/15/2008

Modify/Update this entry


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

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society