We consider a variant of the well-known Single Node Fixed-Charge Network (SNFCN) set where a set-up variable is associated with the node, indicating whether the node is open or not. This set arises as a relaxation of several practical mixed integer problems. We relate the polyhedral structure of this variant with the polyhedral structure of the SNFCN set. We show that in the presence of the node set-up variable new facet-defining inequalities appear and establish the relation between the new family of inequalities with the flow cover inequalities. For the constant capacitated case we provide a full polyhedral description of the convex hull of the given set.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Price includes VAT (USA)
Tax calculation will be finalised during checkout.
Archetti, C., Bertazzi, L., Laporte, G., Speranza, M.G.: A Branch-and-Cut Algorithm for a vendor-managed inventory-routing problem. Transp. Sci. 41, 382–391 (2007)
Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89, 3–44 (1998)
Christof, T., Löbel, A.: PORTA-POlyhedron Representation Transformation Algorithm (2008). http://typo.zib.de/opt-long_projects/Software/Porta/
Correia, I., Gouveia, L., Saldanha-da-Gama, F.: Discretized formulations for capacitated location problems with modular distribution costs. Eur. J. Oper. Res. 204, 237–244 (2010)
Gu, Z., Nemhauser, G.L., Savelsbergh, W.P.: Lifted flow cover inequalities for mixed 0–1 integer programs. Math. Program. 85, 439–467 (1999)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Padberg, M.W., Van Roy, T.J., Wolsey, L.A.: Valid linear inequalities for fixed charge problems. Oper. Res. 33, 842–861 (1985)
Zhao, Y., Klabjan, D.: A polyhedral study of lot-sizing with supplier selection. Discrete Optim. 9, 65–76 (2012)
This work was supported by FEDER funds through COMPETE and by Portuguese funds through CIDMA and FCT within project PEst-C/MAT/UI4106/2011 with COMPETE number FCOMP-01-0124-FEDER- 022690.
About this article
Cite this article
Agra, A., Doostmohammadi, M. Facets for the single node fixed-charge network set with a node set-up variable. Optim Lett 8, 1501–1515 (2014). https://doi.org/10.1007/s11590-013-0677-7
- Mixed integer sets
- Valid inequalities
- Single node flow set