Valid inequalities for the single arc design problem with set-ups

Padberg, 1985, Valid linear inequalities for fixed charge problems, Oper. Res., 33, 842, 10.1287/opre.33.4.842 Magnanti, 1993, The convex hull of two core capacitated network design problems, Math. Program., 60, 233, 10.1007/BF01580612 Pochet, 2006 Zhao, 2012, A polyhedral study of lot-sizing with supplier selection, Discrete Optim., 9, 65, 10.1016/j.disopt.2011.09.001 Archetti, 2007, A branch-and-cut algorithm for a vendor-managed inventory-routing problem, Transp. Sci., 41, 382, 10.1287/trsc.1060.0188 Agra, 2014, Facets for the single node fixed-charge network set with a node set-up variable, Optim. Lett., 8, 1501, 10.1007/s11590-013-0677-7 Martin, 1991, Using separation algorithms to generate mixed integer model reformulations, Oper. Res. Lett., 10, 119, 10.1016/0167-6377(91)90028-N Aardal, 1995, Capacitated facility location: valid inequalities and facets, Math. Oper. Res., 20, 562, 10.1287/moor.20.3.562 Balas, 1998, Disjunctive programming: properties of the convex hull of feasible points, Discrete Appl. Math., 89, 3, 10.1016/S0166-218X(98)00136-X Doostmohammadi, 2014 Louveaux, 2003, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, 4OR, 1, 173 Nemhauser, 1988 Xpress-Optimizer, http://www.fico.com/en/Products/DMTools/Pages/FICO-Xpress-Optimization-Suite.aspx. Lovasz, 1979, Graphs theory and integer programming, Ann. Discrete Math., 4, 141, 10.1016/S0167-5060(08)70822-7