IDEAS home Printed from https://ideas.repec.org/p/wop/iasawp/wp96106.html
   My bibliography  Save this paper

Modular Optimizer for Mixed Integer Programming MOMIP Version 2.3

Author

Listed:
  • W. Ogryczak
  • K. Zorychta

Abstract

No abstract is available for this item.

Suggested Citation

  • W. Ogryczak & K. Zorychta, 1996. "Modular Optimizer for Mixed Integer Programming MOMIP Version 2.3," Working Papers wp96106, International Institute for Applied Systems Analysis.
    • Handle: RePEc:wop:iasawp:wp96106
    as

    Download full text from publisher

    File URL: http://www.iiasa.ac.at/Publications/Documents/WP-96-106.pdf
    Download Restriction: no
    File URL: http://www.iiasa.ac.at/Publications/Documents/WP-96-106.ps
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. J. J. H. Forrest & J. P. H. Hirst & J. A. Tomlin, 1974. "Practical Solution of Large Mixed Integer Programming Problems with Umpire," Management Science, INFORMS, vol. 20(5), pages 736-773, January.
    2. VAN ROY, Tony J. & WOLSEY, Laurence A., 1987. "Solving mixed integer programming problems using automatic reformulation," LIDAM Reprints CORE 782, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. M. Makowski, 1994. "LP-DIT Data Interchange Tool for Linear Programming Problems (version 1.20)," Working Papers wp94036, International Institute for Applied Systems Analysis.
    4. Tony J. Van Roy & Laurence A. Wolsey, 1987. "Solving Mixed Integer Programming Problems Using Automatic Reformulation," Operations Research, INFORMS, vol. 35(1), pages 45-57, February.
    5. W. Ogryczak & K. Zorychta, 1994. "Modular Optimizer for Mixed Integer Programming MOMIP Version 2.1," Working Papers wp94035, International Institute for Applied Systems Analysis.
    6. Ellis L. Johnson & Michael M. Kostreva & Uwe H. Suhl, 1985. "Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models," Operations Research, INFORMS, vol. 33(4), pages 803-819, 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. J. Granat & M. Makowski, 1998. "ISAAP - Interactive Specification and Analysis of Aspiration-Based Preferences," Working Papers ir98052, International Institute for Applied Systems Analysis.
    2. Granat, Janusz & Makowski, Marek, 2000. "Interactive specification and analysis of aspiration-based preferences," European Journal of Operational Research, Elsevier, vol. 122(2), pages 469-485, April.

    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. W. Ogryczak & K. Zorychta, 1994. "Modular Optimizer for Mixed Integer Programming MOMIP Version 2.1," Working Papers wp94035, International Institute for Applied Systems Analysis.
    2. Awi Federgruen & Joern Meissner & Michal Tzur, 2007. "Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 55(3), pages 490-502, June.
    3. Alves, Maria Joao & Climaco, Joao, 1999. "Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 117(3), pages 565-577, September.
    4. Pourbabai, B. & Ashayeri, J. & Van Wassenhove, L.N., 1992. "Strategic marketing, production, and distribution planning of an integrated manufacturing system," Other publications TiSEM 16c2bacb-2c2b-427e-b429-c, Tilburg University, School of Economics and Management.
    5. Bian, Zheyong & Bai, Yun & Douglas, W. Scott & Maher, Ali & Liu, Xiang, 2022. "Multi-year planning for optimal navigation channel dredging and dredged material management," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    6. William Cook & Thomas Rutherford & Herbert E. Scarf & David F. Shallcross, 1991. "An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming," Cowles Foundation Discussion Papers 990, Cowles Foundation for Research in Economics, Yale University.
    7. A. Swietanowski, 1995. "A Modular Presolve Procedure for Large Scale Linear Programming," Working Papers wp95113, International Institute for Applied Systems Analysis.
    8. Alper Atamtürk & Martin Savelsbergh, 2005. "Integer-Programming Software Systems," Annals of Operations Research, Springer, vol. 140(1), pages 67-124, November.
    9. Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    10. Agostinho Agra & Cristina Requejo & Eulália Santos, 2016. "Implicit cover inequalities," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1111-1129, April.
    11. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
    12. Gavin J. Bell & Bruce W. Lamar & Chris A. Wallace, 1999. "Capacity improvement, penalties, and the fixed charge transportation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(4), pages 341-355, June.
    13. 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).
    14. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar & Mohammad Hassan Sharifitabar, 2015. "A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 48-58, February.
    15. Richard Laundy & Michael Perregaard & Gabriel Tavares & Horia Tipi & Alkis Vazacopoulos, 2009. "Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 304-313, May.
    16. Lawrence C. Leung & Yer Van Hui & Yong Wang & Gang Chen, 2009. "A 0--1 LP Model for the Integration and Consolidation of Air Cargo Shipments," Operations Research, INFORMS, vol. 57(2), pages 402-412, April.
    17. Yogesh Agarwal & Yash Aneja, 2012. "Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron," Operations Research, INFORMS, vol. 60(3), pages 638-654, June.
    18. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    19. Cynthia Barnhart & Hong Jin & Pamela H. Vance, 2000. "Railroad Blocking: A Network Design Application," Operations Research, INFORMS, vol. 48(4), pages 603-614, August.
    20. Yi Zhang & Nikolaos V. Sahinidis & Carlos Nohra & Gang Rong, 2020. "Optimality-based domain reduction for inequality-constrained NLP and MINLP problems," Journal of Global Optimization, Springer, vol. 77(3), pages 425-454, July.

    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:wop:iasawp:wp96106. 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: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/iiasaat.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.