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

Some thoughts on combinatorial optimisation

Author

Listed:
  • Bjorndal, M. H.
  • Caprara, A.
  • Cowling, P. I.
  • Della Croce, F.
  • Lourenco, H.
  • Malucelli, F.
  • Orman, A. J.
  • Pisinger, D.
  • Rego, C.
  • Salazar, J. J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Bjorndal, M. H. & Caprara, A. & Cowling, P. I. & Della Croce, F. & Lourenco, H. & Malucelli, F. & Orman, A. J. & Pisinger, D. & Rego, C. & Salazar, J. J., 1995. "Some thoughts on combinatorial optimisation," European Journal of Operational Research, Elsevier, vol. 83(2), pages 253-270, June.
    • Handle: RePEc:eee:ejores:v:83:y:1995:i:2:p:253-270
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)00005-B
    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.

    References listed on IDEAS

    as
    1. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    2. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    3. Gavish, Bezalel, 1992. "Topological design of computer communication networks -- The overall design problem," European Journal of Operational Research, Elsevier, vol. 58(2), pages 149-172, April.
    4. Egon Balas & Eitan Zemel, 1980. "An Algorithm for Large Zero-One Knapsack Problems," Operations Research, INFORMS, vol. 28(5), pages 1130-1154, October.
    5. Karla L. Hoffman & Manfred Padberg, 1993. "Solving Airline Crew Scheduling Problems by Branch-and-Cut," Management Science, INFORMS, vol. 39(6), pages 657-682, June.
    6. A. Balakrishnan & T. L. Magnanti & R. T. Wong, 1989. "A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design," Operations Research, INFORMS, vol. 37(5), pages 716-740, October.
    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. Jann Michael Weinand & Kenneth Sorensen & Pablo San Segundo & Max Kleinebrahm & Russell McKenna, 2020. "Research trends in combinatorial optimisation," Papers 2012.01294, arXiv.org.
    2. Gravel, Marc & Price, Wilson L. & Gagne, Caroline, 2002. "Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic," European Journal of Operational Research, Elsevier, vol. 143(1), pages 218-229, November.

    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. M-G Yoon & J Current, 2008. "The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 80-89, January.
    2. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    3. İbrahim Muter & Ş. İlker Birbil & Güvenç Şahin, 2010. "Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 603-619, November.
    4. Abdolsalam Ghaderi, 2015. "Heuristic Algorithms for Solving an Integrated Dynamic Center Facility Location - Network Design Model," Networks and Spatial Economics, Springer, vol. 15(1), pages 43-69, March.
    5. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    6. Panta Lučić & Dušan Teodorović, 2007. "Metaheuristics approach to the aircrew rostering problem," Annals of Operations Research, Springer, vol. 155(1), pages 311-338, November.
    7. Kaj Holmberg & Johan Hellstrand, 1998. "Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound," Operations Research, INFORMS, vol. 46(2), pages 247-259, April.
    8. Herrmann, J. W. & Ioannou, G. & Minis, I. & Proth, J. M., 1996. "A dual ascent approach to the fixed-charge capacitated network design problem," European Journal of Operational Research, Elsevier, vol. 95(3), pages 476-490, December.
    9. Gendron, Bernard, 2002. "A note on "a dual-ascent approach to the fixed-charge capacitated network design problem"," European Journal of Operational Research, Elsevier, vol. 138(3), pages 671-675, May.
    10. Kaj Holmberg & Di Yuan, 2000. "A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem," Operations Research, INFORMS, vol. 48(3), pages 461-481, June.
    11. van de Leensel, R.L.J.M. & Flippo, O.E. & Koster, Arie M.C.A. & Kolen, A.W.J., 1996. "A dynamic programming algorithm for the local access network expansion problem," Research Memorandum 027, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    12. Agarwal, Y.K. & Aneja, Y.P., 2017. "Fixed charge multicommodity network design using p-partition facets," European Journal of Operational Research, Elsevier, vol. 258(1), pages 124-135.
    13. Fragkos, Ioannis & Cordeau, Jean-François & Jans, Raf, 2021. "Decomposition methods for large-scale network expansion problems," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 60-80.
    14. Teodor Gabriel Crainic & Michel Gendreau & Judith M. Farvolden, 2000. "A Simplex-Based Tabu Search Method for Capacitated Network Design," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 223-236, August.
    15. Costamagna, Eugenio & Fanni, Alessandra & Giacinto, Giorgio, 1998. "A Tabu Search algorithm for the optimisation of telecommunication networks," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 357-372, April.
    16. 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.
    17. H Gunnarsson & M Rönnqvist & D Carlsson, 2006. "A combined terminal location and ship routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(8), pages 928-938, August.
    18. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    19. Li, Gang & Balakrishnan, Anantaram, 2016. "Models and algorithms for network reduction," European Journal of Operational Research, Elsevier, vol. 248(3), pages 930-942.
    20. Ping Josephine Xu & Russell Allgor & Stephen C. Graves, 2009. "Benefits of Reevaluating Real-Time Order Fulfillment Decisions," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 340-355, January.

    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:83:y:1995:i:2:p:253-270. 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: 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.