Oktay Günlük, Jeff Linderoth
Mathematical Programming
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.
Oktay Günlük, Jeff Linderoth
Mathematical Programming
Pierre Bonami, Oktay Günlük, et al.
Mathematical Programming Computation
Alper Atamtürk, Oktay Günlük
Networks
Rui Chen, Sanjeeb Dash, et al.
Discrete Optimization