IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v55y2004i3d10.1057_palgrave.jors.2601655.html
   My bibliography  Save this article

A Branch & Cut algorithm for a four-index assignment problem

Author

Listed:
  • G Appa

    (London School of Economics)

  • D Magos

    (Technological Educational Institute of Athens)

  • I Mourtos

    (London School of Economics)

Abstract

In this paper, we examine the orthogonal Latin squares (OLS) problem from an integer programming perspective. The OLS problem has a long history and its significance arises from both theoretical aspects and practical applications. The problem is formulated as a four-index assignment problem whose solutions correspond to OLS. This relationship is exploited by various routines (preliminary variable fixing, branching, etc) of the Branch & Cut algorithm we present. Clique, odd-hole and antiweb inequalities implement the ‘Cut’ component of the algorithm. For each cut type a polynomial-time separation algorithm is implemented. Extensive computational analysis examines multiple aspects concerning the design of our algorithm. The results illustrate clearly the improvement achieved over simple Branch & Bound.

Suggested Citation

  • G Appa & D Magos & I Mourtos, 2004. "A Branch & Cut algorithm for a four-index assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 298-307, March.
  • Handle: RePEc:pal:jorsoc:v:55:y:2004:i:3:d:10.1057_palgrave.jors.2601655
    DOI: 10.1057/palgrave.jors.2601655
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601655
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/palgrave.jors.2601655?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. Egon Balas & Matthew J. Saltzman, 1991. "An Algorithm for the Three-Index Assignment Problem," Operations Research, INFORMS, vol. 39(1), pages 150-161, February.
    2. 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.
    3. Magos, D. & Miliotis, P., 1994. "An algorithm for the planar three-index assignment problem," European Journal of Operational Research, Elsevier, vol. 77(1), pages 141-153, August.
    4. Atamturk, Alper & Nemhauser, George L. & Savelsbergh, Martin W. P., 2000. "Conflict graphs in solving integer programming problems," European Journal of Operational Research, Elsevier, vol. 121(1), pages 40-55, February.
    5. Egon Balas & Sebastián Ceria & Gérard Cornuéjols, 1996. "Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework," Management Science, INFORMS, vol. 42(9), pages 1229-1246, September.
    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. Appa, G. & Magos, D. & Mourtos, I., 2006. "Searching for Mutually Orthogonal Latin Squares via integer and constraint programming," European Journal of Operational Research, Elsevier, vol. 173(2), pages 519-530, September.
    2. Zhang, Abraham & Luo, Hao & Huang, George Q., 2013. "A bi-objective model for supply chain design of dispersed manufacturing in China," International Journal of Production Economics, Elsevier, vol. 146(1), pages 48-58.

    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. Avella, Pasquale & D'Auria, Bernardo & Salerno, Saverio, 2006. "A LP-based heuristic for a time-constrained routing problem," European Journal of Operational Research, Elsevier, vol. 173(1), pages 120-124, August.
    2. Drexl, Andreas & Nissen, Rudiger & Patterson, James H. & Salewski, Frank, 2000. "ProGen/[pi]x - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions," European Journal of Operational Research, Elsevier, vol. 125(1), pages 59-72, August.
    3. P. Senthil Kumar, 2020. "Developing a New Approach to Solve Solid Assignment Problems Under Intuitionistic Fuzzy Environment," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 9(1), pages 1-34, January.
    4. Urban, Timothy L. & Russell, Robert A., 2003. "Scheduling sports competitions on multiple venues," European Journal of Operational Research, Elsevier, vol. 148(2), pages 302-311, July.
    5. P. Senthil Kumar, 2020. "Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set," 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. 11(1), pages 189-222, February.
    6. Tuomas Sandholm & Subhash Suri & Andrew Gilpin & David Levine, 2005. "CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions," Management Science, INFORMS, vol. 51(3), pages 374-390, March.
    7. Mustafa Kılınç & Jeff Linderoth & James Luedtke & Andrew Miller, 2014. "Strong-branching inequalities for convex mixed integer nonlinear programs," Computational Optimization and Applications, Springer, vol. 59(3), pages 639-665, December.
    8. Jeff T. Linderoth & Eva K. Lee & Martin W. P. Savelsbergh, 2001. "A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems," INFORMS Journal on Computing, INFORMS, vol. 13(3), pages 191-209, August.
    9. Haroldo G. Santos & Túlio A. M. Toffolo & Rafael A. M. Gomes & Sabir Ribas, 2016. "Integer programming techniques for the nurse rostering problem," Annals of Operations Research, Springer, vol. 239(1), pages 225-251, April.
    10. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    11. Egon Balas & Sebastián Ceria & Milind Dawande & Francois Margot & Gábor Pataki, 2001. "Octane: A New Heuristic for Pure 0--1 Programs," Operations Research, INFORMS, vol. 49(2), pages 207-225, April.
    12. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    13. 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.
    14. John N. Hooker, 2002. "Logic, Optimization, and Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 295-321, November.
    15. Sriram, Chellappan & Haghani, Ali, 2003. "An optimization model for aircraft maintenance scheduling and re-assignment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(1), pages 29-48, January.
    16. Haase, Knut, 1999. "Retail business staff scheduling under complex labor relations," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 511, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    17. Fischetti, M. & Kroon, L.G. & Timmer, G. & Vromans, M.J.C.M. & Abbink, E.J.W., 2004. "Reinventing Crew Scheduling at Netherlands Railways," ERIM Report Series Research in Management ERS-2004-046-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.
    18. Gang Yu & Michael Argüello & Gao Song & Sandra M. McCowan & Anna White, 2003. "A New Era for Crew Recovery at Continental Airlines," Interfaces, INFORMS, vol. 33(1), pages 5-22, February.
    19. Rossi, Fabrizio & Smriglio, Stefano, 2001. "A set packing model for the ground holding problem in congested networks," European Journal of Operational Research, Elsevier, vol. 131(2), pages 400-416, June.
    20. Erwin Abbink & Matteo Fischetti & Leo Kroon & Gerrit Timmer & Michiel Vromans, 2005. "Reinventing Crew Scheduling at Netherlands Railways," Interfaces, INFORMS, vol. 35(5), pages 393-401, October.

    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:pal:jorsoc:v:55:y:2004:i:3:d:10.1057_palgrave.jors.2601655. 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.palgrave-journals.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.