The CVRPSEP package is a collection of routines, written in the C programming language, for separation of various classes of cuts in branch-and-cut algorithms for the Capacitated Vehicle Routing Problem. The routines are those that were used in ”A New Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem” (by Lysgaard, Letchford, and Eglese, published in Mathematical Programming - see Publications). The package contains separation routines for rounded capacity inequalities, homogeneous multistar inequalities, generalized multistar inequalities, framed capacity inequalities, strengthened comb inequalities, and hypotour inequalities. In addition, the package contains a routine for generating candidate sets for branching.

References in zbMATH (referenced in 129 articles , 1 standard article )

Showing results 1 to 20 of 129.
Sorted by year (citations)

1 2 3 ... 5 6 7 next

  1. Baller, Annelieke C.; Dabia, Said; Desaulniers, Guy; Dullaert, Wout E. H.: The inventory routing problem with demand moves (2021)
  2. Ceselli, Alberto; Felipe, Ángel; Ortuño, M. Teresa; Righini, Giovanni; Tirado, Gregorio: A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies (2021)
  3. Dalmeijer, Kevin; Desaulniers, Guy: Addressing orientation symmetry in the time window assignment vehicle routing problem (2021)
  4. Gadegaard, S. L.; Lysgaard, J.: A symmetry-free polynomial formulation of the capacitated vehicle routing problem (2021)
  5. Heßler, Katrin; Irnich, Stefan: A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (2021)
  6. Manousakis, Eleftherios; Repoussis, Panagiotis; Zachariadis, Emmanouil; Tarantilis, Christos: Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation (2021)
  7. Pessoa, Artur Alves; Poss, Michael; Sadykov, Ruslan; Vanderbeck, François: Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty (2021)
  8. Schenekemberg, Cleder M.; Scarpin, Cassius T.; Pécora, José E.; Guimarães, Thiago A.; Coelho, Leandro C.: The two-echelon production-routing problem (2021)
  9. Subramanyam, Anirudh; Mufalli, Frank; Laínez-Aguirre, José M.; Pinto, Jose M.; Gounaris, Chrysanthos E.: Robust multiperiod vehicle routing under customer order uncertainty (2021)
  10. Tresoldi, Emanuele; Malucelli, Federico; Nonato, Maddalena: A personalized walking bus service requiring optimized route decisions: a real case (2021)
  11. uit het Broek, Michiel A. J.; Schrotenboer, Albert H.; Jargalsaikhan, Bolor; Roodbergen, Kees Jan; Coelho, Leandro C.: Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm (2021)
  12. van Zon, Mathijs; Desaulniers, Guy: The joint network vehicle routing game with optional customers (2021)
  13. Zhang, Yu; Zhang, Zhenzhen; Lim, Andrew; Sim, Melvyn: Robust data-driven vehicle routing with time windows (2021)
  14. Agarwal, Yogesh Kumar; Venkateshan, Prahalad: A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries (2020)
  15. Alvarez, Aldair; Cordeau, Jean-François; Jans, Raf; Munari, Pedro; Morabito, Reinaldo: Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (2020)
  16. Aziez, Imadeddine; Côté, Jean-François; Coelho, Leandro C.: Exact algorithms for the multi-pickup and delivery problem with time windows (2020)
  17. Chitsaz, Masoud; Cordeau, Jean-François; Jans, Raf: A branch-and-cut algorithm for an assembly routing problem (2020)
  18. Ghosal, Shubhechyya; Wiesemann, Wolfram: The distributionally robust chance-constrained vehicle routing problem (2020)
  19. Marques, Guillaume; Sadykov, Ruslan; Deschamps, Jean-Christophe; Dupas, Rémy: An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (2020)
  20. Pessoa, Artur; Sadykov, Ruslan; Uchoa, Eduardo; Vanderbeck, François: A generic exact solver for vehicle routing and related problems (2020)

1 2 3 ... 5 6 7 next