IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-68640-0_9.html
   My bibliography  Save this book chapter

Linear Assignment Problems in Combinatorial Optimization

In: Optimization Methods and Applications

Author

Listed:
  • Boris Goldengorin

    (Ohio University
    University of Florida)

  • Dmitry Krushinsky

    (Wageningen University and Research)

Abstract

In this chapter we introduce the notion of a “pattern” in the Linear Assignment Problem and show that patterns may be useful to create new insights and approaches for many combinatorial optimization problems defined on a rectangular input matrix. We define a pattern as a specific collection of cells in the rectangular matrix reflecting the structure of an optimal solution to the original combinatorial optimization problem (COP). We illustrate the notion of pattern by means of some well-known problems in combinatorial optimization, including the variations of the Linear Ordering Problem, the Cell Formation Problem, and some others. Then, we give a detailed consideration to pattern-based solution approaches for the two mentioned problems.

Suggested Citation

  • Boris Goldengorin & Dmitry Krushinsky, 2017. "Linear Assignment Problems in Combinatorial Optimization," Springer Optimization and Its Applications, in: Sergiy Butenko & Panos M. Pardalos & Volodymyr Shylo (ed.), Optimization Methods and Applications, pages 183-216, Springer.
    • Handle: RePEc:spr:spochp:978-3-319-68640-0_9
    DOI: 10.1007/978-3-319-68640-0_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spochp:978-3-319-68640-0_9. 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.