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

A rearrangement of adjacency matrix based approach for solving the crossing minimization problem

Author

Listed:
  • Neng Fan

    (University of Florida)

  • Panos M. Pardalos

    (University of Florida)

Abstract

In this paper, we first present a binary linear programming formulation for the crossing minimization problem (CMP) in bipartite graphs. Then we use the models of a modified minimum cost flow problem (MMCF) and a travelling salesman problem (TSP) to approximatively solve the CMP by rearranging the adjacency matrix of the bipartite graph. Our approaches are useful for problems defined on dense bipartite graphs. In addition, we compute the exact crossing numbers for some general dense graphs.

Suggested Citation

  • Neng Fan & Panos M. Pardalos, 2011. "A rearrangement of adjacency matrix based approach for solving the crossing minimization problem," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 747-762, November.
    • Handle: RePEc:spr:jcomop:v:22:y:2011:i:4:d:10.1007_s10878-010-9326-6
    DOI: 10.1007/s10878-010-9326-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-010-9326-6
    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-9326-6?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. Christoph Buchheim & Angelika Wiegele & Lanbo Zheng, 2010. "Exact Algorithms for the Quadratic Linear Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 168-177, February.
    2. Valls, Vicente & Marti, Rafael & Lino, Pilar, 1996. "A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs," European Journal of Operational Research, Elsevier, vol. 90(2), pages 303-319, April.
    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. Palubeckis, Gintaras & Tomkevičius, Arūnas & Ostreika, Armantas, 2019. "Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization," Applied Mathematics and Computation, Elsevier, vol. 348(C), pages 84-101.

    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. Palubeckis, Gintaras & Tomkevičius, Arūnas & Ostreika, Armantas, 2019. "Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization," Applied Mathematics and Computation, Elsevier, vol. 348(C), pages 84-101.
    2. Nathan Sudermann‐Merx & Steffen Rebennack & Christian Timpe, 2021. "Crossing Minimal Edge‐Constrained Layout Planning using Benders Decomposition," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3429-3447, October.
    3. Hungerländer, Philipp & Anjos, Miguel F., 2015. "A semidefinite optimization-based approach for global optimization of multi-row facility layout," European Journal of Operational Research, Elsevier, vol. 245(1), pages 46-61.
    4. Christoph Buchheim & Emiliano Traversi, 2018. "Quadratic Combinatorial Optimization Using Separable Underestimators," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 424-437, August.

    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-9326-6. 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.