Sanjeeb Dash, Oktay Günlük, et al.
Discrete Optimization
In network design problems,capacity constraints are modeled in three different ways depending on the application: directed, bidirected and undirected. In the literature, polyhedral investigations for strengthening mixed-integer formulations are done separately for each model. In this note, we examine the relationship between these models to provide a unifying approach and show that one can indeed translate valid inequalities from one to the others.
Sanjeeb Dash, Oktay Günlük, et al.
Discrete Optimization
Sanjeeb Dash, Santanu S. Dey, et al.
Mathematical Programming
Ricardo Fukasawa, Oktay Günlük
Discrete Optimization
Sanjeeb Dash, Oktay Günlük, et al.
Mathematical Programming