IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v40y2010i6p465-476.html
   My bibliography  Save this article

Tutorial: COIN-OR: Software for the OR Community

Author

Listed:
  • Kipp Martin

    (Booth School of Business, University of Chicago, Chicago, Illinois 60637)

Abstract

The goal of the COIN-OR Foundation is to serve the operations research community by providing both software and the necessary infrastructure to foster the development and deployment of cutting-edge computational operations research. Many people in the operations research community are either not familiar with just how much COIN-OR can benefit them, or do not know how to obtain and use COIN-OR software. In this tutorial, we first show how COIN-OR software can be applied in the workplace, in the classroom, and in research. We then show how to obtain and use COIN-OR software. We consider two classes of users: those who want to use the COIN-OR software but are not interested in compiling code and those who wish to write code that uses this software as a foundation for their applications.

Suggested Citation

  • Kipp Martin, 2010. "Tutorial: COIN-OR: Software for the OR Community," Interfaces, INFORMS, vol. 40(6), pages 465-476, December.
    • Handle: RePEc:inm:orinte:v:40:y:2010:i:6:p:465-476
    DOI: 10.1287/inte.1100.0534
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1100.0534
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.1100.0534?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Regan Murray & William E. Hart & Cynthia A. Phillips & Jonathan Berry & Erik G. Boman & Robert D. Carr & Lee Ann Riesen & Jean-Paul Watson & Terra Haxton & Jonathan G. Herrmann & Robert Janke & George, 2009. "US Environmental Protection Agency Uses Operations Research to Reduce Contamination Risks in Drinking Water," Interfaces, INFORMS, vol. 39(1), pages 57-68, February.
    2. Cynthia Barnhart & Christopher A. Hane & Pamela H. Vance, 2000. "Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems," Operations Research, INFORMS, vol. 48(2), pages 318-326, April.
    3. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    4. Harlan Crowder & Ellis L. Johnson & Manfred Padberg, 1983. "Solving Large-Scale Zero-One Linear Programming Problems," Operations Research, INFORMS, vol. 31(5), pages 803-834, October.
    5. Y. Xu & T. K. Ralphs & L. Ladányi & M. J. Saltzman, 2009. "Computational Experience with a Software Framework for Parallel Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 383-397, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Zhi Chen & Peng Xiong, 2023. "RSOME in Python: An Open-Source Package for Robust Stochastic Optimization Made Easy," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 717-724, July.
    2. Alexandra M. Newman & Martin Weiss, 2013. "A Survey of Linear and Mixed-Integer Optimization Tutorials," INFORMS Transactions on Education, INFORMS, vol. 14(1), pages 26-38, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    2. Amy Cohn & Michael Magazine & George Polak, 2009. "Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 215-225, April.
    3. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    4. Kang, Jangha & Park, Kyungchul & Park, Sungsoo, 2009. "Optimal multicast route packing," European Journal of Operational Research, Elsevier, vol. 196(1), pages 351-359, July.
    5. Jinil Han & Kyungsik Lee & Chungmok Lee & Sungsoo Park, 2013. "Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 585-596, August.
    6. Ng, T.S. & Lee, L.H. & Chew, E.P., 2006. "Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1117-1140, December.
    7. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    8. Baris Yildiz & Martin Savelsbergh, 2019. "Provably High-Quality Solutions for the Meal Delivery Routing Problem," Transportation Science, INFORMS, vol. 53(5), pages 1372-1388, September.
    9. Zhixing Luo & Hu Qin & T. C. E. Cheng & Qinghua Wu & Andrew Lim, 2021. "A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 452-476, May.
    10. Barış Yıldız & Oya Ekin Karaşan, 2017. "Regenerator Location Problem in Flexible Optical Networks," Operations Research, INFORMS, vol. 65(3), pages 595-620, June.
    11. Lienkamp, Benedikt & Schiffer, Maximilian, 2024. "Column generation for solving large scale multi-commodity flow problems for passenger transportation," European Journal of Operational Research, Elsevier, vol. 314(2), pages 703-717.
    12. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm," Transportation Science, INFORMS, vol. 39(4), pages 539-552, November.
    13. Degraeve, Z. & Jans, R.F., 2003. "A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-010-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    14. Ellis L. Johnson & George L. Nemhauser & Martin W.P. Savelsbergh, 2000. "Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 2-23, February.
    15. Gamvros, Ioannis & Raghavan, S., 2012. "Multi-period traffic routing in satellite networks," European Journal of Operational Research, Elsevier, vol. 219(3), pages 738-750.
    16. Hadi W. Purnomo & Jonathan F. Bard, 2007. "Cyclic preference scheduling for nurses using branch and price," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 200-220, March.
    17. Alfandari, Laurent & Plateau, Agnès & Scheplerc, Xavier, 2014. "A Branch-and-Price-and-Cut Approach for Sustainable Crop Rotation Planning," ESSEC Working Papers WP1408, ESSEC Research Center, ESSEC Business School.
    18. Alfandari, Laurent & Plateau, Agnès & Schepler, Xavier, 2015. "A branch-and-price-and-cut approach for sustainable crop rotation planning," European Journal of Operational Research, Elsevier, vol. 241(3), pages 872-879.
    19. Elias Munapo & Santosh Kumar, 2021. "Reducing the complexity of the knapsack linear integer problem by reformulation techniques," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(6), pages 1087-1093, December.
    20. Laurent Alfandari & Agnès Plateau & Xavier Schepler, 2014. "A Branch-and-Price-and-Cut approach for Sustainable Crop Rotation Planning," Working Papers hal-00987708, HAL.

    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:inm:orinte:v:40:y:2010:i:6:p:465-476. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.