Advertisement

Optimization Letters

, Volume 8, Issue 4, pp 1501–1515 | Cite as

Facets for the single node fixed-charge network set with a node set-up variable

  • Agostinho AgraEmail author
  • Mahdi Doostmohammadi
Original Paper

Abstract

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.

Keywords

Mixed integer sets Valid inequalities Single node flow set 

Notes

Acknowledgments

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.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89, 3–44 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Christof, T., Löbel, A.: PORTA-POlyhedron Representation Transformation Algorithm (2008). http://typo.zib.de/opt-long_projects/Software/Porta/
  4. 4.
    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)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Gu, Z., Nemhauser, G.L., Savelsbergh, W.P.: Lifted flow cover inequalities for mixed 0–1 integer programs. Math. Program. 85, 439–467 (1999)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)zbMATHGoogle Scholar
  7. 7.
    Padberg, M.W., Van Roy, T.J., Wolsey, L.A.: Valid linear inequalities for fixed charge problems. Oper. Res. 33, 842–861 (1985)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
  9. 9.
    Zhao, Y., Klabjan, D.: A polyhedral study of lot-sizing with supplier selection. Discrete Optim. 9, 65–76 (2012)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Department of Mathematics and CIDMAUniversity of Aveiro AveiroPortugal

Personalised recommendations