IDEAS home Printed from https://ideas.repec.org/p/hal/wpaper/hal-05379834.html

Optimization heuristic for large-scale B2B integral debt netting

Author

Listed:
  • Joannès Guichon

    (Centre Inria de l'Université de Lorraine - Inria - Institut National de Recherche en Informatique et en Automatique, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications - Inria - Institut National de Recherche en Informatique et en Automatique - CentraleSupélec - UL - Université de Lorraine - CNRS - Centre National de la Recherche Scientifique, MOCQUA - Designing the Future of Computational Models - Centre Inria de l'Université de Lorraine - Inria - Institut National de Recherche en Informatique et en Automatique - LORIA - FM - Department of Formal Methods - LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications - Inria - Institut National de Recherche en Informatique et en Automatique - CentraleSupélec - UL - Université de Lorraine - CNRS - Centre National de la Recherche Scientifique, SIMBIOT - SIMulating and Building IOT - LORIA - NSS - Department of Networks, Systems and Services - LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications - Inria - Institut National de Recherche en Informatique et en Automatique - CentraleSupélec - UL - Université de Lorraine - CNRS - Centre National de la Recherche Scientifique)

  • Sylvain Contassot-Vivier

    (LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications - Inria - Institut National de Recherche en Informatique et en Automatique - CentraleSupélec - UL - Université de Lorraine - CNRS - Centre National de la Recherche Scientifique, UL - Université de Lorraine)

  • Nazim Fatès

    (MOCQUA - Designing the Future of Computational Models - Centre Inria de l'Université de Lorraine - Inria - Institut National de Recherche en Informatique et en Automatique - LORIA - FM - Department of Formal Methods - LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications - Inria - Institut National de Recherche en Informatique et en Automatique - CentraleSupélec - UL - Université de Lorraine - CNRS - Centre National de la Recherche Scientifique, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications - Inria - Institut National de Recherche en Informatique et en Automatique - CentraleSupélec - UL - Université de Lorraine - CNRS - Centre National de la Recherche Scientifique)

Abstract

Deferred payments are widely used in the business-to-business (B2B) economy as an important short-term financing source. However, the resulting pending invoices create complex debt webs and may induce cascading liquidity shortages that jeopardize the system's stability. This paper presents a framework for integral debt netting (that is, without fragmenting debts) that aims to lower liquidity needs by settling selected invoices thanks to an external funder. This framework models B2B obligations as weighted directed multi-graphs and uses various metrics to assess how effectively external financing enables invoice clearing. In addition, we propose several extensions to provide scalability to large problem instances as well as adaptability to constraints over the working capital. We describe a specific division strategy to manage large datasets while preserving the results' quality and providing limited computation times. A set of experiments with synthetic and large-size real data allows us to evaluate the behavior of our process and the quality of its results. They show that our algorithm obtains a good trade-off between the netting quality and the network's coverage.

Suggested Citation

  • Joannès Guichon & Sylvain Contassot-Vivier & Nazim Fatès, 2025. "Optimization heuristic for large-scale B2B integral debt netting," Working Papers hal-05379834, HAL.
  • Handle: RePEc:hal:wpaper:hal-05379834
    Note: View the original document on HAL open archive server: https://hal.science/hal-05379834v1
    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
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    JEL classification:

    Statistics

    Access and download statistics

    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:hal:wpaper:hal-05379834. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.