IDEAS home Printed from https://ideas.repec.org/a/spr/aqjoor/v23y2025i1d10.1007_s10288-025-00585-z.html
   My bibliography  Save this article

A tutorial on Branch-Price-and-Cut algorithms

Author

Listed:
  • Matteo Petris

    (Univ. Lille, Inria, CNRS, Centrale Lille, UMR 9189 CRIStAL
    CERMICS, ENPC, Institut Polytechnique de Paris)

  • Claudia Archetti

    (University of Brescia)

  • Diego Cattaruzza

    (University of Udine
    Univ. Lille, CNRS, Inria, Centrale Lille, UMR 9189 CRIStAL)

  • Maxime Ogier

    (Univ. Lille, CNRS, Inria, Centrale Lille, UMR 9189 CRIStAL)

  • Frédéric Semet

    (Univ. Lille, CNRS, Inria, Centrale Lille, UMR 9189 CRIStAL)

Abstract

This paper provides a tutorial on Branch-Price-and-Cut (BPC) algorithms for a generic class of problems whose objective is to find a set of feasible paths in a graph while optimising a given objective function. The tutorial is split into two main parts. First, we describe the building blocks of a BPC algorithm: the Branch-and-Bound algorithm, the column generation procedure and the Branch-and-Cut algorithm. Then, we focus on the description of a BPC algorithm for the class of problems we consider. Precisely, we present the classical and advanced techniques that should be embedded in an efficient algorithm. Particular attention is devoted to the solution of the pricing problem in the case where it is formulated as an Elementary Shortest Path Problem with Resource Constraints. The aim of the tutorial is pedagogical. Hence, its intended reader is someone facing the first implementation of a BPC algorithm. Implementation tips and examples accompany the techniques and concepts to ease their comprehension. Precisely, the examples are based on the Capacitated Vehicle Routing Problem, which is a well-known problem belonging to the class we consider.

Suggested Citation

  • Matteo Petris & Claudia Archetti & Diego Cattaruzza & Maxime Ogier & Frédéric Semet, 2025. "A tutorial on Branch-Price-and-Cut algorithms," 4OR, Springer, vol. 23(1), pages 1-52, March.
    • Handle: RePEc:spr:aqjoor:v:23:y:2025:i:1:d:10.1007_s10288-025-00585-z
    DOI: 10.1007/s10288-025-00585-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10288-025-00585-z
    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/s10288-025-00585-z?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.

    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:aqjoor:v:23:y:2025:i:1:d:10.1007_s10288-025-00585-z. 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: 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.