IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v255y2015icp84-91.html
   My bibliography  Save this article

Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph

Author

Listed:
  • Gimadi, Edward Kh.

Abstract

Some hard-to solve combinatorial problems of finding several disjoint discrete structures in complete weighted graph are considered. Efficient algorithms with performance guarantees are constructed for the Euclidean m-Peripatetic Salesman Problem, m-Weighted Clique Problem and m-Layer Planar three-index Assignment Problem.

Suggested Citation

  • Gimadi, Edward Kh., 2015. "Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph," Applied Mathematics and Computation, Elsevier, vol. 255(C), pages 84-91.
    • Handle: RePEc:eee:apmaco:v:255:y:2015:i:c:p:84-91
    DOI: 10.1016/j.amc.2014.11.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300314015604
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2014.11.037?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. Edward Kh. Gimadi, 2006. "On Some Probability Inequalities for Some Discrete Optimization Problems," Operations Research Proceedings, in: Hans-Dietrich Haasis & Herbert Kopfer & Jörn Schönberger (ed.), Operations Research Proceedings 2005, pages 283-289, Springer.
    2. James Roskind & Robert E. Tarjan, 1985. "A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees," Mathematics of Operations Research, INFORMS, vol. 10(4), pages 701-708, November.
    3. Frieze, A. M., 1983. "Complexity of a 3-dimensional assignment problem," European Journal of Operational Research, Elsevier, vol. 13(2), pages 161-164, June.
    4. Yury Glazkov, 2007. "On Asymptotically Optimal Algorithm for One Modification of Planar 3-dimensional Assignment Problem," Operations Research Proceedings, in: Karl-Heinz Waldmann & Ulrike M. Stocker (ed.), Operations Research Proceedings 2006, pages 175-179, Springer.
    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. Yokoya, Daisuke & Duin, Cees W. & Yamada, Takeo, 2011. "A reduction approach to the repeated assignment problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 185-193, April.
    2. Arora, Shalini & Puri, M. C., 1998. "A variant of time minimizing assignment problem," European Journal of Operational Research, Elsevier, vol. 110(2), pages 314-325, October.
    3. Xiaoli Ma & Baoyindureng Wu & Xian’an Jin, 2018. "Edge-disjoint spanning trees and the number of maximum state circles of a graph," Journal of Combinatorial Optimization, Springer, vol. 35(4), pages 997-1008, May.
    4. Kravtsov, M.K. & Lukshin, E.V., 2008. "Polyhedral combinatorics of multi-index axial transportation problems," European Journal of Operational Research, Elsevier, vol. 189(3), pages 920-938, September.
    5. T. Werth & H. Sperber & S. Krumke, 2014. "Computation of equilibria and the price of anarchy in bottleneck congestion games," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 687-712, December.
    6. Penn, M.L. & Potts, C.N. & Harper, P.R., 2017. "Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables," European Journal of Operational Research, Elsevier, vol. 262(1), pages 194-206.
    7. A. T. Ernst & R. G. J. Mills & P. Welgama, 2003. "Scheduling Appointments at Trade Events for the Australian Tourist Commission," Interfaces, INFORMS, vol. 33(3), pages 12-23, June.
    8. Renata M. Aiex & Mauricio G. C. Resende & Panos M. Pardalos & Gerardo Toraldo, 2005. "GRASP with Path Relinking for Three-Index Assignment," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 224-247, May.
    9. Boštjan Gabrovšek & Tina Novak & Janez Povh & Darja Rupnik Poklukar & Janez Žerovnik, 2020. "Multiple Hungarian Method for k -Assignment Problem," Mathematics, MDPI, vol. 8(11), pages 1-18, November.
    10. Chassein, André B. & Goerigk, Marc, 2015. "A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem," European Journal of Operational Research, Elsevier, vol. 244(3), pages 739-747.
    11. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    12. Briskorn, Dirk & Drexl, Andreas & Spieksma, Frits C. R., 2005. "Round robin tournaments and three index assignment," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 604, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Kim, Bum-Jin & Hightower, William L. & Hahn, Peter M. & Zhu, Yi-Rong & Sun, Lu, 2010. "Lower bounds for the axial three-index assignment problem," European Journal of Operational Research, Elsevier, vol. 202(3), pages 654-668, May.
    14. Vladyslav Sokol & Ante Ćustić & Abraham P. Punnen & Binay Bhattacharya, 2020. "Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 730-746, July.

    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:eee:apmaco:v:255:y:2015:i:c:p:84-91. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.