IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v149y2007i1p177-18310.1007-s10479-006-0094-8.html
   My bibliography  Save this article

Broadening the integer programming audience, the LINDO perspective

Author

Listed:

Abstract

No abstract is available for this item.

Suggested Citation

  • Linus Schrage & Kevin Cunningham, 2007. "Broadening the integer programming audience, the LINDO perspective," Annals of Operations Research, Springer, vol. 149(1), pages 177-183, February.
    • Handle: RePEc:spr:annopr:v:149:y:2007:i:1:p:177-183:10.1007/s10479-006-0094-8
    DOI: 10.1007/s10479-006-0094-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0094-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0094-8?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
    ---><---

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

    References listed on IDEAS

    as
    1. 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.
    2. John D. C. Little & Katta G. Murty & Dura W. Sweeney & Caroline Karel, 1963. "An Algorithm for the Traveling Salesman Problem," Operations Research, INFORMS, vol. 11(6), pages 972-989, December.
    Full references (including those not matched with items on IDEAS)

    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. Codas, Andrés & Camponogara, Eduardo, 2012. "Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing," European Journal of Operational Research, Elsevier, vol. 217(1), pages 222-231.
    2. Wei-Kun Chen & Liang Chen & Mu-Ming Yang & Yu-Hong Dai, 2018. "Generalized coefficient strengthening cuts for mixed integer programming," Journal of Global Optimization, Springer, vol. 70(1), pages 289-306, January.
    3. José Berenguel & L. Casado & I. García & Eligius Hendrix, 2013. "On estimating workload in interval branch-and-bound global optimization algorithms," Journal of Global Optimization, Springer, vol. 56(3), pages 821-844, July.
    4. N. Kazazakis & C. S. Adjiman, 2018. "Arbitrarily tight $$\alpha $$ α BB underestimators of general non-linear functions over sub-optimal domains," Journal of Global Optimization, Springer, vol. 71(4), pages 815-844, August.
    5. 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.
    6. Srinivasa, Anand V. & Wilhelm, Wilbert E., 1997. "A procedure for optimizing tactical response in oil spill clean up operations," European Journal of Operational Research, Elsevier, vol. 102(3), pages 554-574, November.
    7. 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.
    8. Joaquín Antonio Pacheco Bonrostro, 1995. "Problemas de rutas con carga y descarga en sistemas lifo: soluciones exactas," Estudios de Economia Aplicada, Estudios de Economia Aplicada, vol. 3, pages 69-86, Junio.
    9. B. Dietrich & L. Escudero & A. Garín & G. Pérez, 1993. "O(n) Procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 1(1), pages 139-160, December.
    10. Tomáš Režnar & Jan Martinovič & Kateřina Slaninová & Ekaterina Grakova & Vít Vondrák, 2017. "Probabilistic time-dependent vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(3), pages 545-560, September.
    11. Bogna MRÓWCZYŃSKA, 2015. "Multicriteria vehicle routing problem solved by artificial immune system," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 10(3), pages 141-152, September.
    12. Amitabh Basu & Pierre Bonami & Gérard Cornuéjols & François Margot, 2011. "Experiments with Two-Row Cuts from Degenerate Tableaux," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 578-590, November.
    13. Eva K. Lee, 2004. "Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Computing Environment," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 3-26, February.
    14. Haque, Md Tabish & Hamid, Faiz, 2023. "Social distancing and revenue management—A post-pandemic adaptation for railways," Omega, Elsevier, vol. 114(C).
    15. Olivier Briant & Denis Naddef, 2004. "The Optimal Diversity Management Problem," Operations Research, INFORMS, vol. 52(4), pages 515-526, August.
    16. Escudero Bueno, Laureano F. & Garín Martín, María Araceli & Merino Maestre, María & Pérez Sainz de Rozas, Gloria, 2011. "A parallelizable algorithmic framework for solving large scale multi-stage stochastic mixed 0-1 problems under uncertainty," BILTOKI 1134-8984, Universidad del País Vasco - Departamento de Economía Aplicada III (Econometría y Estadística).
    17. Harjunkoski, Iiro & Westerlund, Tapio & Porn, Ray & Skrifvars, Hans, 1998. "Different transformations for solving non-convex trim-loss problems by MINLP," European Journal of Operational Research, Elsevier, vol. 105(3), pages 594-603, March.
    18. Michael Windham & J. Hutchinson & Shizuhiko Nishisato & Ludovic Lebart & George Furnas & Richard Dubes & Frank Critchley & A. Gordon & Fionn Murtagh & Ulf Bockenholt & Philip Hopke & Daniel Wartenberg, 1988. "Book reviews," Journal of Classification, Springer;The Classification Society, vol. 5(1), pages 105-154, March.
    19. Nikolakopoulos, Athanassios & Sarimveis, Haralambos, 2007. "A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1911-1929, 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:spr:annopr:v:149:y:2007:i:1:p:177-183:10.1007/s10479-006-0094-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.