Skip to main content
SpringerLink
Log in

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

Optimization Letters volume 8, pages 1501–1515 (2014)Cite this article

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.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

USD 39.95

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

References

  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)

    Article  Google Scholar 

  2. Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89, 3–44 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Christof, T., Löbel, A.: PORTA-POlyhedron Representation Transformation Algorithm (2008). http://typo.zib.de/opt-long_projects/Software/Porta/

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  6. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)

    MATH  Google Scholar 

  7. Padberg, M.W., Van Roy, T.J., Wolsey, L.A.: Valid linear inequalities for fixed charge problems. Oper. Res. 33, 842–861 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  8. Xpress-Optimizer. http://www.fico.com/en/Products/DMTools/Pages/FICO-Xpress-Optimization-Suite.aspx

  9. Zhao, Y., Klabjan, D.: A polyhedral study of lot-sizing with supplier selection. Discrete Optim. 9, 65–76 (2012)

    Article  MATH  MathSciNet  Google Scholar 

Download references

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.

Author information

Authors and Affiliations

  1. Department of Mathematics and CIDMA, University of Aveiro, Aveiro, Portugal

    Agostinho Agra & Mahdi Doostmohammadi

Authors
  1. Agostinho Agra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mahdi Doostmohammadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Agostinho Agra.

Rights and permissions

Reprints and Permissions

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-013-0677-7

Keywords

search

Navigation