IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v22y2011i4d10.1007_s10878-010-9333-7.html
   My bibliography  Save this article

Polynomially solvable special cases of the quadratic bottleneck assignment problem

Author

Listed:
  • Rainer E. Burkard

    (Graz University of Technology)

  • Roswitha Rissner

    (Graz University of Technology)

Abstract

Quadratic bottleneck assignment problems (QBAP) are obtained by replacing the addition of cost terms in the objective function of a quadratic (sum) assignment problem by taking their maximum. Since the QBAP is an $\mathcal{NP}$ -hard problem, polynimially solvable special cases of the QBAP are of interest. In this paper we specify conditions on the cost matrices of QBAP leading to special cases which can be solved to optimality in polynomial time. In particular, the following three cases are discussed: (i) any permutation is optimal (constant QBAP), (ii) a certain specified permutation is optimal (constant permutation QBAP) and (iii) the solution can be found algorithmically by a polynomial algorithm. Moreover, the max-cone of bottleneck Monge matrices is investigated, its generating matrices are identified and it is used as a tool in proving polynomiality results.

Suggested Citation

  • Rainer E. Burkard & Roswitha Rissner, 2011. "Polynomially solvable special cases of the quadratic bottleneck assignment problem," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 845-856, November.
    • Handle: RePEc:spr:jcomop:v:22:y:2011:i:4:d:10.1007_s10878-010-9333-7
    DOI: 10.1007/s10878-010-9333-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-010-9333-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-010-9333-7?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.

    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:jcomop:v:22:y:2011:i:4:d:10.1007_s10878-010-9333-7. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.