IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/vyid10.1007_s10878-020-00627-8.html
   My bibliography  Save this article

Bottleneck subset-type restricted matching problems

Author

Listed:
  • Oleg Duginov

    (Belarusian State University)

Abstract

We introduce two problems related to finding in a weighted complete bipartite graph a special matching such that the maximum weight of its some subsets is minimal. We discuss their applications and show the strong NP-hardness of both problems. We show that one problem cannot be approximated in polynomial time within a factor of less than 2 and another problem cannot be approximated in polynomial time within a factor of $$\alpha (n)$$ α ( n ) , where $$\alpha (n)$$ α ( n ) is an arbitrary polynomial-time computable function, unless $$\hbox {P} = \hbox {NP}$$ P = NP .

Suggested Citation

  • Oleg Duginov, 0. "Bottleneck subset-type restricted matching problems," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-10.
    • Handle: RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-020-00627-8
    DOI: 10.1007/s10878-020-00627-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00627-8
    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-020-00627-8?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. Nils Boysen & Malte Fliedner & Florian Jaehn & Erwin Pesch, 2013. "A Survey on Container Processing in Railway Yards," Transportation Science, INFORMS, vol. 47(3), pages 312-329, August.
    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. Lennart Zey & Dirk Briskorn & Nils Boysen, 2022. "Twin-crane scheduling during seaside workload peaks with a dedicated handshake area," Journal of Scheduling, Springer, vol. 25(1), pages 3-34, February.
    2. Shujuan Guo & Cuijie Diao & Gang Li & Katsuhiko Takahashi, 2021. "The Two-Echelon Dual-Channel Models for the Intermodal Container Terminals of the China Railway Express Considering Container Accumulation Modes," Sustainability, MDPI, vol. 13(5), pages 1-19, March.
    3. Yan, Baicheng & Jin, Jian Gang & Zhu, Xiaoning & Lee, Der-Horng & Wang, Li & Wang, Hua, 2020. "Integrated planning of train schedule template and container transshipment operation in seaport railway terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    4. Mantovani, Serena & Morganti, Gianluca & Umang, Nitish & Crainic, Teodor Gabriel & Frejinger, Emma & Larsen, Eric, 2018. "The load planning problem for double-stack intermodal trains," European Journal of Operational Research, Elsevier, vol. 267(1), pages 107-119.
    5. Nils Boysen & Simon Emde & Malte Fliedner, 2016. "The basic train makeup problem in shunting yards," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 207-233, January.
    6. Boysen, Nils & Briskorn, Dirk & Fedtke, Stefan & Schmickerath, Marcel, 2019. "Automated sortation conveyors: A survey from an operational research perspective," European Journal of Operational Research, Elsevier, vol. 276(3), pages 796-815.
    7. El Yaagoubi, Amina & Ferjani, Aicha & Essaghir, Yasmina & Sheikhahmadi, Farrokh & Abourraja, Mohamed Nezar & Boukachour, Jaouad & Baron, Marie-Laure & Duvallet, Claude & Khodadad-Saryazdi, Ali, 2022. "A logistic model for a french intermodal rail/road freight transportation system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    8. Martin Tschöke & Nils Boysen, 2018. "Container supply with multi-trailer trucks: parking strategies to speed up the gantry crane-based loading of freight trains in rail yards," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(2), pages 319-339, March.
    9. Basallo-Triana, Mario José & Bravo-Bastidas, Juan José & Vidal-Holguín, Carlos Julio, 2022. "A rail-road transshipment yard picture," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    10. Stefan Fedtke & Nils Boysen, 2017. "Gantry crane and shuttle car scheduling in modern rail–rail transshipment yards," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 473-503, March.
    11. Michał Kłodawski & Roland Jachimowski & Norbert Chamier-Gliszczyński, 2024. "Analysis of the Overhead Crane Energy Consumption Using Different Container Loading Strategies in Urban Logistics Hubs," Energies, MDPI, vol. 17(5), pages 1-24, February.
    12. Wang, Ning & Jin, Bo & Lim, Andrew, 2015. "Target-guided algorithms for the container pre-marshalling problem," Omega, Elsevier, vol. 53(C), pages 67-77.
    13. Guo, Peng & Weidinger, Felix & Boysen, Nils, 2019. "Parallel machine scheduling with job synchronization to enable efficient material flows in hub terminals," Omega, Elsevier, vol. 89(C), pages 110-121.
    14. Alena Otto & Xiyu Li & Erwin Pesch, 2017. "Two-Way Bounded Dynamic Programming Approach for Operations Planning in Transshipment Yards," Transportation Science, INFORMS, vol. 51(1), pages 325-342, February.
    15. Bruns, Florian & Knust, Sigrid & Shakhlevich, Natalia V., 2016. "Complexity results for storage loading problems with stacking constraints," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1074-1081.
    16. Kuzmicz, Katarzyna Anna & Pesch, Erwin, 2019. "Approaches to empty container repositioning problems in the context of Eurasian intermodal transportation," Omega, Elsevier, vol. 85(C), pages 194-213.
    17. Kress, Dominik & Meiswinkel, Sebastian & Pesch, Erwin, 2015. "The Partitioning Min–Max Weighted Matching Problem," European Journal of Operational Research, Elsevier, vol. 247(3), pages 745-754.
    18. Nils Boysen & Dirk Briskorn & Simon Emde, 2018. "Scheduling electric vehicles and locating charging stations on a path," Journal of Scheduling, Springer, vol. 21(1), pages 111-126, February.
    19. Konrad Stephan & Nils Boysen, 2017. "Crane scheduling in railway yards: an analysis of computational complexity," Journal of Scheduling, Springer, vol. 20(5), pages 507-526, October.
    20. Zenker, Michael & Emde, Simon & Boysen, Nils, 2016. "Cyclic inventory routing in a line-shaped network," European Journal of Operational Research, Elsevier, vol. 250(1), pages 164-178.

    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::y::i::d:10.1007_s10878-020-00627-8. 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.