IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v71y1993i1p95-109.html
   My bibliography  Save this article

Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems

Author

Listed:
  • Rardin, Ronald L.
  • Wolsey, Laurence A.

Abstract

No abstract is available for this item.

Suggested Citation

  • Rardin, Ronald L. & Wolsey, Laurence A., 1993. "Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems," European Journal of Operational Research, Elsevier, vol. 71(1), pages 95-109, November.
    • Handle: RePEc:eee:ejores:v:71:y:1993:i:1:p:95-109
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(93)90263-M
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cunha, Jesus O. & Melo, Rafael A., 2021. "Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure," European Journal of Operational Research, Elsevier, vol. 295(3), pages 874-892.
    2. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    3. Ming Zhao & Minjiao Zhang, 2020. "Multiechelon Lot Sizing: New Complexities and Inequalities," Operations Research, INFORMS, vol. 68(2), pages 534-551, March.
    4. Ayşegül Altın & Hande Yaman & Mustafa Ç. Pınar, 2011. "The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 75-89, February.
    5. Dinakar Gade & Simge Küçükyavuz, 2013. "Formulations for dynamic lot sizing with service levels," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(2), pages 87-101, March.
    6. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    7. Wei, Mingyuan & Qi, Mingyao & Wu, Tao & Zhang, Canrong, 2019. "Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials," European Journal of Operational Research, Elsevier, vol. 277(2), pages 521-541.
    8. Keely L. Croxton & Bernard Gendron & Thomas L. Magnanti, 2007. "Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs," Operations Research, INFORMS, vol. 55(1), pages 146-157, February.
    9. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    10. ORTEGA, Francisco & WOLSEY, Laurence, 2000. "A branch-and-cut algorithm for the single commodity uncapacitated fixed charge network flow problem," LIDAM Discussion Papers CORE 2000049, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    11. Erika Buson & Roberto Roberti & Paolo Toth, 2014. "A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem," Operations Research, INFORMS, vol. 62(5), pages 1095-1106, October.
    12. Roberto Roberti & Enrico Bartolini & Aristide Mingozzi, 2015. "The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation," Management Science, INFORMS, vol. 61(6), pages 1275-1291, June.
    13. Aristide Mingozzi & Roberto Roberti, 2018. "An Exact Algorithm for the Fixed Charge Transportation Problem Based on Matching Source and Sink Patterns," Transportation Science, INFORMS, vol. 52(2), pages 229-238, March.
    14. Hanif D. Sherali & Taehyung Park, 2000. "Discrete equal‐capacity p‐median problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 166-183, March.
    15. Jesus Cunha & Rafael Melo, 2016. "On reformulations for the one-warehouse multi-retailer problem," Annals of Operations Research, Springer, vol. 238(1), pages 99-122, March.
    16. Minjiao Zhang & Simge Küçükyavuz & Hande Yaman, 2012. "A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands," Operations Research, INFORMS, vol. 60(4), pages 918-935, August.
    17. Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2017. "Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design," Transportation Science, INFORMS, vol. 51(2), pages 650-667, May.
    18. Yogesh Agarwal & Yash Aneja, 2012. "Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron," Operations Research, INFORMS, vol. 60(3), pages 638-654, June.
    19. Jesus O. Cunha & Rafael A. Melo, 2016. "On reformulations for the one-warehouse multi-retailer problem," Annals of Operations Research, Springer, vol. 238(1), pages 99-122, March.
    20. Kerem Akartunalı & Andrew Miller, 2012. "A computational analysis of lower bounds for big bucket production planning problems," Computational Optimization and Applications, Springer, vol. 53(3), pages 729-753, December.
    21. Sunil Chopra & M.R. Rao & Chih‐Yang Tsai, 1997. "Computational study of the multiechelon production planning problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(1), pages 1-19, February.
    22. AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:71:y:1993:i:1:p:95-109. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.