IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v195y2022i2d10.1007_s10957-022-02091-2.html
   My bibliography  Save this article

On Recognizing Staircase Compatibility

Author

Listed:
  • Andreas Bärmann

    (Friedrich-Alexander-Universität Erlangen-Nürnberg)

  • Patrick Gemander

    (Fraunhofer-Institut für Integrierte Schaltungen IIS)

  • Alexander Martin

    (Friedrich-Alexander-Universität Erlangen-Nürnberg)

  • Maximilian Merkert

    (Technische Universität Braunschweig)

Abstract

For the problem to find an m-clique in an m-partite graph, staircase compatibility has recently been introduced as a polynomial-time solvable special case. It is a property of a graph together with an m-partition of the vertex set and total orders on each subset of the partition. In optimization problems involving m-cliques in m-partite graphs as a subproblem, it allows for totally unimodular linear programming formulations, which have shown to efficiently solve problems from different applications. In this work, we address questions concerning the recognizability of this property in the case where the m-partition of the graph is given, but suitable total orders are to be determined. While finding these total orders is NP-hard in general, we give several conditions under which it can be done in polynomial time. For bipartite graphs, we present a polynomial-time algorithm to recognize staircase compatibility and show that staircase total orders are unique up to a small set of reordering operations. On m-partite graphs, where the recognition problem is NP-complete in the general case, we identify a polynomially solvable subcase and also provide a corresponding algorithm to compute the total orders. Finally, we evaluate the performance of our ordering algorithm for m-partite graphs on a set of artificial instances as well as real-world instances from a railway timetabling application. It turns out that applying the ordering algorithm to the real-world instances and subsequently solving the problem via the aforementioned totally unimodular reformulations indeed outperforms a generic formulation which does not exploit staircase compatibility.

Suggested Citation

  • Andreas Bärmann & Patrick Gemander & Alexander Martin & Maximilian Merkert, 2022. "On Recognizing Staircase Compatibility," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 449-479, November.
    • Handle: RePEc:spr:joptap:v:195:y:2022:i:2:d:10.1007_s10957-022-02091-2
    DOI: 10.1007/s10957-022-02091-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-022-02091-2
    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/s10957-022-02091-2?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. Andreas Bärmann & Alexander Martin & Oskar Schneider, 2021. "Efficient Formulations and Decomposition Approaches for Power Peak Reduction in Railway Traffic via Timetabling," Transportation Science, INFORMS, vol. 55(3), pages 747-767, May.
    2. Andreas Bärmann & Alexander Martin & Oskar Schneider, 2017. "A comparison of performance metrics for balancing the power consumption of trains in a railway network by slight timetable adaptation," Public Transport, Springer, vol. 9(1), pages 95-113, July.
    Full references (including those not matched with items on IDEAS)

    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. Aleksandra Kuzior & Marek Staszek, 2021. "Energy Management in the Railway Industry: A Case Study of Rail Freight Carrier in Poland," Energies, MDPI, vol. 14(21), pages 1-21, October.
    2. Wang, Xuekai & D’Ariano, Andrea & Su, Shuai & Tang, Tao, 2023. "Cooperative train control during the power supply shortage in metro system: A multi-agent reinforcement learning approach," Transportation Research Part B: Methodological, Elsevier, vol. 170(C), pages 244-278.
    3. Andreas Bärmann & Alexander Martin & Oskar Schneider, 2021. "Efficient Formulations and Decomposition Approaches for Power Peak Reduction in Railway Traffic via Timetabling," Transportation Science, INFORMS, vol. 55(3), pages 747-767, May.
    4. Chen, Zebin & Li, Shukai & D’Ariano, Andrea & Yang, Lixing, 2022. "Real-time optimization for train regulation and stop-skipping adjustment strategy of urban rail transit lines," Omega, Elsevier, vol. 110(C).

    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:joptap:v:195:y:2022:i:2:d:10.1007_s10957-022-02091-2. 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.